Base | Representation |
---|---|
bin | 10111001100010011001101… |
… | …100000100100010101011011 |
3 | 111101011010200110101200212110 |
4 | 113030103031200210111123 |
5 | 101332133134242241443 |
6 | 1000534145534443403 |
7 | 30325165202664321 |
oct | 2714231540442533 |
9 | 441133613350773 |
10 | 102000331212123 |
11 | 2a55610890a593 |
12 | b534420663563 |
13 | 44bb7891b5a06 |
14 | 1b28bb167bd11 |
15 | bbd3e18c4233 |
hex | 5cc4cd82455b |
102000331212123 has 8 divisors (see below), whose sum is σ = 136464606947088. Its totient is φ = 67768138142624.
The previous prime is 102000331212077. The next prime is 102000331212149. The reversal of 102000331212123 is 321212133000201.
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 102000331212123 - 210 = 102000331211099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102000331212123.
It is not an unprimeable number, because it can be changed into a prime (102000331211123) 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, 58020665340 + ... + 58020667097.
It is an arithmetic number, because the mean of its divisors is an integer number (17058075868386).
Almost surely, 2102000331212123 is an apocalyptic number.
102000331212123 is a deficient number, since it is larger than the sum of its proper divisors (34464275734965).
102000331212123 is a wasteful number, since it uses less digits than its factorization.
102000331212123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116041332733.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 102000331212123 its reverse (321212133000201), we get a palindrome (423212464212324).
The spelling of 102000331212123 in words is "one hundred two trillion, three hundred thirty-one million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •