Base | Representation |
---|---|
bin | 1001010111101010000001… |
… | …1011011011110011010011 |
3 | 1100110212022201000112101210 |
4 | 2111322200123123303103 |
5 | 2322242020404402011 |
6 | 33524403432431203 |
7 | 2112203510463126 |
oct | 225724033336323 |
9 | 40425281015353 |
10 | 10302023122131 |
11 | 331207752a984 |
12 | 11a4726848503 |
13 | 599627168a00 |
14 | 278898c283bd |
15 | 12cea50306a6 |
hex | 95ea06dbcd3 |
10302023122131 has 24 divisors (see below), whose sum is σ = 14877506242560. Its totient is φ = 6338180905056.
The previous prime is 10302023122037. The next prime is 10302023122207. The reversal of 10302023122131 is 13122132020301.
It is not a de Polignac number, because 10302023122131 - 215 = 10302023089363 is a prime.
It is a super-2 number, since 2×103020231221312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10302023122098 and 10302023122107.
It is not an unprimeable number, because it can be changed into a prime (10302023122231) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 334231 + ... + 4551456.
It is an arithmetic number, because the mean of its divisors is an integer number (619896093440).
Almost surely, 210302023122131 is an apocalyptic number.
10302023122131 is a deficient number, since it is larger than the sum of its proper divisors (4575483120429).
10302023122131 is a wasteful number, since it uses less digits than its factorization.
10302023122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4889875 (or 4889862 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10302023122131 its reverse (13122132020301), we get a palindrome (23424155142432).
The spelling of 10302023122131 in words is "ten trillion, three hundred two billion, twenty-three million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •