Base | Representation |
---|---|
bin | 110001110011010001101… |
… | …000011111010111100011 |
3 | 110010011120201221220011010 |
4 | 301303101220133113203 |
5 | 422032343110120003 |
6 | 11140104334152003 |
7 | 502153025461461 |
oct | 61632150372743 |
9 | 13104521856133 |
10 | 3422311020003 |
11 | 10aa437395687 |
12 | 473325052603 |
13 | 1ba951578c15 |
14 | bb8d827b831 |
15 | 5e04ec05003 |
hex | 31cd1a1f5e3 |
3422311020003 has 8 divisors (see below), whose sum is σ = 4583007480400. Its totient is φ = 2271577619808.
The previous prime is 3422311019999. The next prime is 3422311020013. The reversal of 3422311020003 is 3000201132243.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3422311020003 - 22 = 3422311019999 is a prime.
It is a super-2 number, since 2×34223110200032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3422311020013) 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, 2490764248 + ... + 2490765621.
It is an arithmetic number, because the mean of its divisors is an integer number (572875935050).
Almost surely, 23422311020003 is an apocalyptic number.
3422311020003 is a deficient number, since it is larger than the sum of its proper divisors (1160696460397).
3422311020003 is a wasteful number, since it uses less digits than its factorization.
3422311020003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4981530101.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 3422311020003 its reverse (3000201132243), we get a palindrome (6422512152246).
The spelling of 3422311020003 in words is "three trillion, four hundred twenty-two billion, three hundred eleven million, twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •