Base | Representation |
---|---|
bin | 1001000110111110111000… |
… | …11000111000111010001011 |
3 | 2121220221211220002000220011 |
4 | 10203133130120320322023 |
5 | 10111142223240411243 |
6 | 110334101334212351 |
7 | 4135126034536132 |
oct | 443373430707213 |
9 | 77827756060804 |
10 | 20031130013323 |
11 | 6423177755880 |
12 | 22b6200ab40b7 |
13 | b23c09807870 |
14 | 4d37247b8919 |
15 | 24b0c7cc389d |
hex | 1237dc638e8b |
20031130013323 has 16 divisors (see below), whose sum is σ = 23655008887776. Its totient is φ = 16722244823040.
The previous prime is 20031130013249. The next prime is 20031130013329. The reversal of 20031130013323 is 32331003113002.
It is a cyclic number.
It is not a de Polignac number, because 20031130013323 - 217 = 20031129882251 is a prime.
It is a super-2 number, since 2×200311300133232 (a number of 27 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 = 20031130013294 and 20031130013303.
It is not an unprimeable number, because it can be changed into a prime (20031130013329) 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, 362868340 + ... + 362923537.
It is an arithmetic number, because the mean of its divisors is an integer number (1478438055486).
Almost surely, 220031130013323 is an apocalyptic number.
20031130013323 is a deficient number, since it is larger than the sum of its proper divisors (3623878874453).
20031130013323 is a wasteful number, since it uses less digits than its factorization.
20031130013323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 725792094.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 20031130013323 its reverse (32331003113002), we get a palindrome (52362133126325).
The spelling of 20031130013323 in words is "twenty trillion, thirty-one billion, one hundred thirty million, thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •