Base | Representation |
---|---|
bin | 11110000000011011001… |
… | …01111110011101101111 |
3 | 10122120020120102100220212 |
4 | 33000031211332131233 |
5 | 113343012133210111 |
6 | 2105351045133035 |
7 | 134326433121110 |
oct | 17001545763557 |
9 | 3576216370825 |
10 | 1031020210031 |
11 | 368287036909 |
12 | 14799a6ba17b |
13 | 762bcb259c6 |
14 | 37c8a180207 |
15 | 1bc44c1498b |
hex | f00d97e76f |
1031020210031 has 8 divisors (see below), whose sum is σ = 1207048051104. Its totient is φ = 862177178880.
The previous prime is 1031020210009. The next prime is 1031020210079. The reversal of 1031020210031 is 1300120201301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1031020210031 - 238 = 756142303087 is a prime.
It is a super-2 number, since 2×10310202100312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031020209988 and 1031020210015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031020210091) 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, 1796202170 + ... + 1796202743.
It is an arithmetic number, because the mean of its divisors is an integer number (150881006388).
Almost surely, 21031020210031 is an apocalyptic number.
1031020210031 is a deficient number, since it is larger than the sum of its proper divisors (176027841073).
1031020210031 is an equidigital number, since it uses as much as digits as its factorization.
1031020210031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3592404961.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1031020210031 its reverse (1300120201301), we get a palindrome (2331140411332).
The spelling of 1031020210031 in words is "one trillion, thirty-one billion, twenty million, two hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •