Base | Representation |
---|---|
bin | 101111100000110001… |
… | …0100100100010001001 |
3 | 100202100201220201212202 |
4 | 1133001202210202021 |
5 | 3132430004004113 |
6 | 114512245045545 |
7 | 10241300564636 |
oct | 1370142444211 |
9 | 322321821782 |
10 | 102031313033 |
11 | 3a2a901a701 |
12 | 179360b68b5 |
13 | 98105cb610 |
14 | 4d1cb4b18d |
15 | 29c2735258 |
hex | 17c18a4889 |
102031313033 has 8 divisors (see below), whose sum is σ = 115663027200. Its totient is φ = 89225763408.
The previous prime is 102031313009. The next prime is 102031313039. The reversal of 102031313033 is 330313130201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102031313033 - 216 = 102031247497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102031312996 and 102031313014.
It is not an unprimeable number, because it can be changed into a prime (102031313039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206540873 + ... + 206541366.
It is an arithmetic number, because the mean of its divisors is an integer number (14457878400).
Almost surely, 2102031313033 is an apocalyptic number.
102031313033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
102031313033 is a deficient number, since it is larger than the sum of its proper divisors (13631714167).
102031313033 is a wasteful number, since it uses less digits than its factorization.
102031313033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413082271.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 102031313033 its reverse (330313130201), we get a palindrome (432344443234).
The spelling of 102031313033 in words is "one hundred two billion, thirty-one million, three hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •