Base | Representation |
---|---|
bin | 101111101000110100… |
… | …0001110101110100001 |
3 | 100210001112211001010202 |
4 | 1133101220032232201 |
5 | 3134003103411113 |
6 | 114555130234545 |
7 | 10251056060540 |
oct | 1372150165641 |
9 | 323045731122 |
10 | 102301232033 |
11 | 3a427418860 |
12 | 179b0585a55 |
13 | 98544c65c0 |
14 | 4d46930157 |
15 | 29db2a1258 |
hex | 17d1a0eba1 |
102301232033 has 128 divisors (see below), whose sum is σ = 146406113280. Its totient is φ = 68929056000.
The previous prime is 102301232009. The next prime is 102301232071. The reversal of 102301232033 is 330232103201.
It is not a de Polignac number, because 102301232033 - 26 = 102301231969 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102301231996 and 102301232014.
It is not an unprimeable number, because it can be changed into a prime (102301222033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 129988466 + ... + 129989252.
It is an arithmetic number, because the mean of its divisors is an integer number (1143797760).
Almost surely, 2102301232033 is an apocalyptic number.
102301232033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102301232033 is a deficient number, since it is larger than the sum of its proper divisors (44104881247).
102301232033 is a wasteful number, since it uses less digits than its factorization.
102301232033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 102301232033 its reverse (330232103201), we get a palindrome (432533335234).
The spelling of 102301232033 in words is "one hundred two billion, three hundred one million, two hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •