Base | Representation |
---|---|
bin | 10111001100010011000001… |
… | …000110011000111100011011 |
3 | 111101011010010221122121021001 |
4 | 113030103001012120330123 |
5 | 101332132222443220011 |
6 | 1000534113140325431 |
7 | 30325160064262324 |
oct | 2714230106307433 |
9 | 441133127577231 |
10 | 102000123023131 |
11 | 2a556011344073 |
12 | b5343829a3877 |
13 | 44bb755022268 |
14 | 1b28b91b6744b |
15 | bbd3cd49d7c1 |
hex | 5cc4c1198f1b |
102000123023131 has 16 divisors (see below), whose sum is σ = 103538157262848. Its totient is φ = 100469689610400.
The previous prime is 102000123023129. The next prime is 102000123023143. The reversal of 102000123023131 is 131320321000201.
It is a cyclic number.
It is not a de Polignac number, because 102000123023131 - 21 = 102000123023129 is a prime.
It is a super-2 number, since 2×1020001230231312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102000123023099 and 102000123023108.
It is not an unprimeable number, because it can be changed into a prime (102000123023171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68826376 + ... + 70292746.
It is an arithmetic number, because the mean of its divisors is an integer number (6471134828928).
Almost surely, 2102000123023131 is an apocalyptic number.
102000123023131 is a deficient number, since it is larger than the sum of its proper divisors (1538034239717).
102000123023131 is a wasteful number, since it uses less digits than its factorization.
102000123023131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1468962.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 102000123023131 its reverse (131320321000201), we get a palindrome (233320444023332).
The spelling of 102000123023131 in words is "one hundred two trillion, one hundred twenty-three million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •