Base | Representation |
---|---|
bin | 101110111010111110100… |
… | …010001111101001000011 |
3 | 102102020210112002012102121 |
4 | 232322332202033221003 |
5 | 410312104030320003 |
6 | 10505140140225111 |
7 | 451646120542120 |
oct | 56727642175103 |
9 | 12366715065377 |
10 | 3224422120003 |
11 | 1033519254127 |
12 | 440ab853b197 |
13 | 1a50a5733056 |
14 | b20c46d5747 |
15 | 58d1bc8bcbd |
hex | 2eebe88fa43 |
3224422120003 has 16 divisors (see below), whose sum is σ = 3713319118080. Its totient is φ = 2742592975200.
The previous prime is 3224422119983. The next prime is 3224422120027. The reversal of 3224422120003 is 3000212244223.
3224422120003 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3224422120003 - 29 = 3224422119491 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 3224422120003.
It is not an unprimeable number, because it can be changed into a prime (3224422123003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36625948 + ... + 36713878.
It is an arithmetic number, because the mean of its divisors is an integer number (232082444880).
Almost surely, 23224422120003 is an apocalyptic number.
3224422120003 is a deficient number, since it is larger than the sum of its proper divisors (488896998077).
3224422120003 is a wasteful number, since it uses less digits than its factorization.
3224422120003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128058.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 3224422120003 its reverse (3000212244223), we get a palindrome (6224634364226).
The spelling of 3224422120003 in words is "three trillion, two hundred twenty-four billion, four hundred twenty-two million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •