Base | Representation |
---|---|
bin | 1110001100100111110101… |
… | …11011111011100111010011 |
3 | 11002112121100201202021011112 |
4 | 13012103322323323213103 |
5 | 13043002111233301003 |
6 | 150222141310003535 |
7 | 6401400335125340 |
oct | 706237273734723 |
9 | 132477321667145 |
10 | 31220032322003 |
11 | 9a47383383168 |
12 | 36027997a65ab |
13 | 145606200a715 |
14 | 79d0b41b17c7 |
15 | 3921884b73d8 |
hex | 1c64faefb9d3 |
31220032322003 has 16 divisors (see below), whose sum is σ = 36159413422080. Its totient is φ = 26401015289376.
The previous prime is 31220032321991. The next prime is 31220032322041. The reversal of 31220032322003 is 30022323002213.
It is not a de Polignac number, because 31220032322003 - 214 = 31220032305619 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 31220032322003.
It is not an unprimeable number, because it can be changed into a prime (31220032322053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20943200 + ... + 22384317.
It is an arithmetic number, because the mean of its divisors is an integer number (2259963338880).
Almost surely, 231220032322003 is an apocalyptic number.
31220032322003 is a deficient number, since it is larger than the sum of its proper divisors (4939381100077).
31220032322003 is a wasteful number, since it uses less digits than its factorization.
31220032322003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43328906.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 31220032322003 its reverse (30022323002213), we get a palindrome (61242355324216).
The spelling of 31220032322003 in words is "thirty-one trillion, two hundred twenty billion, thirty-two million, three hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •