Base | Representation |
---|---|
bin | 100001101011000101010… |
… | …101011000000001001011 |
3 | 22012012211212010002101210 |
4 | 201223011111120001023 |
5 | 300403034244321303 |
6 | 4531012141344203 |
7 | 326116103662635 |
oct | 41530525300113 |
9 | 8165755102353 |
10 | 2314003120203 |
11 | 8123aa4875a5 |
12 | 314576b68063 |
13 | 13a295525108 |
14 | 7ddd967ba55 |
15 | 402d4bd9203 |
hex | 21ac555804b |
2314003120203 has 16 divisors (see below), whose sum is σ = 3104821391616. Its totient is φ = 1532932803360.
The previous prime is 2314003120127. The next prime is 2314003120249. The reversal of 2314003120203 is 3020213004132.
It is not a de Polignac number, because 2314003120203 - 28 = 2314003119947 is a prime.
It is a super-2 number, since 2×23140031202032 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2314003120203.
It is not an unprimeable number, because it can be changed into a prime (2314003120003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 795513 + ... + 2293653.
It is an arithmetic number, because the mean of its divisors is an integer number (194051336976).
Almost surely, 22314003120203 is an apocalyptic number.
2314003120203 is a deficient number, since it is larger than the sum of its proper divisors (790818271413).
2314003120203 is a wasteful number, since it uses less digits than its factorization.
2314003120203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1501394.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2314003120203 its reverse (3020213004132), we get a palindrome (5334216124335).
The spelling of 2314003120203 in words is "two trillion, three hundred fourteen billion, three million, one hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •