Base | Representation |
---|---|
bin | 1110000111000110000100… |
… | …10001111100111000010101 |
3 | 11001212110010020122211001110 |
4 | 13003203002101330320111 |
5 | 13031344122411411041 |
6 | 145555011014245233 |
7 | 6351564612400125 |
oct | 703430221747025 |
9 | 131773106584043 |
10 | 31030103232021 |
11 | 998387a3597a3 |
12 | 3591a12956819 |
13 | 14411842a57ca |
14 | 793c17830c85 |
15 | 38c26e25b516 |
hex | 1c38c247ce15 |
31030103232021 has 8 divisors (see below), whose sum is σ = 41519666987680. Its totient is φ = 20613637482192.
The previous prime is 31030103231987. The next prime is 31030103232077. The reversal of 31030103232021 is 12023230103013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31030103232021 - 211 = 31030103229973 is a prime.
It is a super-2 number, since 2×310301032320212 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31030103231021) 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, 18274500466 + ... + 18274502163.
It is an arithmetic number, because the mean of its divisors is an integer number (5189958373460).
Almost surely, 231030103232021 is an apocalyptic number.
It is an amenable number.
31030103232021 is a deficient number, since it is larger than the sum of its proper divisors (10489563755659).
31030103232021 is a wasteful number, since it uses less digits than its factorization.
31030103232021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36549002915.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31030103232021 its reverse (12023230103013), we get a palindrome (43053333335034).
The spelling of 31030103232021 in words is "thirty-one trillion, thirty billion, one hundred three million, two hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •