Base | Representation |
---|---|
bin | 1110001110111101011010… |
… | …01010111100011100001001 |
3 | 11002211021121221210020100221 |
4 | 13013132231022330130021 |
5 | 13100311034443411241 |
6 | 150323101331030041 |
7 | 6410242256212510 |
oct | 707365512743411 |
9 | 132737557706327 |
10 | 31300332013321 |
11 | 9a7843a472818 |
12 | 3616269a3b321 |
13 | 14607bb262977 |
14 | 7a2d30a7d677 |
15 | 3942d7e335d1 |
hex | 1c77ad2bc709 |
31300332013321 has 8 divisors (see below), whose sum is σ = 35777163931520. Its totient is φ = 26824839074208.
The previous prime is 31300332013319. The next prime is 31300332013351. The reversal of 31300332013321 is 12331023300313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31300332013321 - 21 = 31300332013319 is a prime.
It is a super-3 number, since 3×313003320133213 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31300332013351) 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, 334694676 + ... + 334788181.
It is an arithmetic number, because the mean of its divisors is an integer number (4472145491440).
Almost surely, 231300332013321 is an apocalyptic number.
It is an amenable number.
31300332013321 is a deficient number, since it is larger than the sum of its proper divisors (4476831918199).
31300332013321 is an equidigital number, since it uses as much as digits as its factorization.
31300332013321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669489543.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 31300332013321 its reverse (12331023300313), we get a palindrome (43631355313634).
The spelling of 31300332013321 in words is "thirty-one trillion, three hundred billion, three hundred thirty-two million, thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •