Base | Representation |
---|---|
bin | 1110000111000110011110… |
… | …01101010100110010001101 |
3 | 11001212110200100210000120110 |
4 | 13003203033031110302031 |
5 | 13031400043422414041 |
6 | 145555044323110233 |
7 | 6351603155054322 |
oct | 703431715246215 |
9 | 131773610700513 |
10 | 31030320123021 |
11 | 998398082915a |
12 | 3591a73512379 |
13 | 14411ba1c508b |
14 | 793c3856cb49 |
15 | 38c283300516 |
hex | 1c38cf354c8d |
31030320123021 has 8 divisors (see below), whose sum is σ = 43807510761984. Its totient is φ = 19470004783040.
The previous prime is 31030320123017. The next prime is 31030320123029. The reversal of 31030320123021 is 12032102303013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31030320123021 - 22 = 31030320123017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31030320123029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 304218824685 + ... + 304218824786.
It is an arithmetic number, because the mean of its divisors is an integer number (5475938845248).
Almost surely, 231030320123021 is an apocalyptic number.
It is an amenable number.
31030320123021 is a deficient number, since it is larger than the sum of its proper divisors (12777190638963).
31030320123021 is a wasteful number, since it uses less digits than its factorization.
31030320123021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608437649491.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31030320123021 its reverse (12032102303013), we get a palindrome (43062422426034).
The spelling of 31030320123021 in words is "thirty-one trillion, thirty billion, three hundred twenty million, one hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •