Base | Representation |
---|---|
bin | 11110000000111101111… |
… | …11000100101111101110 |
3 | 10122120222220110221021221 |
4 | 33000132333010233232 |
5 | 113344111333031110 |
6 | 2105440031213554 |
7 | 134336605243462 |
oct | 17003677045756 |
9 | 3576886427257 |
10 | 1031312002030 |
11 | 368416814522 |
12 | 147a603772ba |
13 | 7633840b7ab |
14 | 37cb6c184a2 |
15 | 1bc606517da |
hex | f01efc4bee |
1031312002030 has 8 divisors (see below), whose sum is σ = 1856361603672. Its totient is φ = 412524800808.
The previous prime is 1031312001997. The next prime is 1031312002031. The reversal of 1031312002030 is 302002131301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10313120020302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1031312001995 and 1031312002013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031312002031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51565600092 + ... + 51565600111.
It is an arithmetic number, because the mean of its divisors is an integer number (232045200459).
Almost surely, 21031312002030 is an apocalyptic number.
1031312002030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1031312002030 is a deficient number, since it is larger than the sum of its proper divisors (825049601642).
1031312002030 is a wasteful number, since it uses less digits than its factorization.
1031312002030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103131200210.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1031312002030 its reverse (302002131301), we get a palindrome (1333314133331).
The spelling of 1031312002030 in words is "one trillion, thirty-one billion, three hundred twelve million, two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •