Base | Representation |
---|---|
bin | 1110000110111001001110… |
… | …11111010100010111100001 |
3 | 11001211210022221021102002211 |
4 | 13003130213133110113201 |
5 | 13031241014043102241 |
6 | 145551511100242121 |
7 | 6351232045055602 |
oct | 703344737242741 |
9 | 131753287242084 |
10 | 31023211300321 |
11 | 9980963007479 |
12 | 359060a840341 |
13 | 14406264a9906 |
14 | 7937623a5da9 |
15 | 38beb918c781 |
hex | 1c37277d45e1 |
31023211300321 has 8 divisors (see below), whose sum is σ = 32372913890880. Its totient is φ = 29673580986192.
The previous prime is 31023211300141. The next prime is 31023211300327. The reversal of 31023211300321 is 12300311232013.
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 31023211300321 - 215 = 31023211267553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31023211300292 and 31023211300301.
It is not an unprimeable number, because it can be changed into a prime (31023211300327) 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, 17191066 + ... + 18909763.
It is an arithmetic number, because the mean of its divisors is an integer number (4046614236360).
Almost surely, 231023211300321 is an apocalyptic number.
It is an amenable number.
31023211300321 is a deficient number, since it is larger than the sum of its proper divisors (1349702590559).
31023211300321 is a wasteful number, since it uses less digits than its factorization.
31023211300321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36138215.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 31023211300321 its reverse (12300311232013), we get a palindrome (43323522532334).
The spelling of 31023211300321 in words is "thirty-one trillion, twenty-three billion, two hundred eleven million, three hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •