Base | Representation |
---|---|
bin | 10111001100010011001100… |
… | …110111000011100101111110 |
3 | 111101011010122200220211112221 |
4 | 113030103030313003211332 |
5 | 101332133124001030420 |
6 | 1000534144505315554 |
7 | 30325165011332326 |
oct | 2714231467034576 |
9 | 441133580824487 |
10 | 102000320330110 |
11 | 2a556102757794 |
12 | b534418a95bba |
13 | 44bb786b75857 |
14 | 1b28bb0048286 |
15 | bbd3e0974caa |
hex | 5cc4ccdc397e |
102000320330110 has 8 divisors (see below), whose sum is σ = 183600576594216. Its totient is φ = 40800128132040.
The previous prime is 102000320330087. The next prime is 102000320330113. The reversal of 102000320330110 is 11033023000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1020003203301102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000320330113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5100016016496 + ... + 5100016016515.
It is an arithmetic number, because the mean of its divisors is an integer number (22950072074277).
Almost surely, 2102000320330110 is an apocalyptic number.
102000320330110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102000320330110 is a deficient number, since it is larger than the sum of its proper divisors (81600256264106).
102000320330110 is a wasteful number, since it uses less digits than its factorization.
102000320330110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10200032033018.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 102000320330110 its reverse (11033023000201), we get a palindrome (113033343330311).
The spelling of 102000320330110 in words is "one hundred two trillion, three hundred twenty million, three hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •