Base | Representation |
---|---|
bin | 100000001101010011000… |
… | …110001111001011011111 |
3 | 21211120220211202110111101 |
4 | 200031103012033023133 |
5 | 242230320342121112 |
6 | 4412435501333531 |
7 | 315622460102641 |
oct | 40152306171337 |
9 | 7746824673441 |
10 | 2213302301407 |
11 | 7837244a2a0a |
12 | 2b8b525672a7 |
13 | 13093777a6c2 |
14 | 791a550c891 |
15 | 3c88e1b9757 |
hex | 2035318f2df |
2213302301407 has 8 divisors (see below), whose sum is σ = 2217469638384. Its totient is φ = 2209135802688.
The previous prime is 2213302301383. The next prime is 2213302301429. The reversal of 2213302301407 is 7041032033122.
2213302301407 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2213302301407 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2213302304407) 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, 5207643 + ... + 5616595.
It is an arithmetic number, because the mean of its divisors is an integer number (277183704798).
Almost surely, 22213302301407 is an apocalyptic number.
2213302301407 is a deficient number, since it is larger than the sum of its proper divisors (4167336977).
2213302301407 is an equidigital number, since it uses as much as digits as its factorization.
2213302301407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419129.
The product of its (nonzero) digits is 6048, while the sum is 28.
Adding to 2213302301407 its reverse (7041032033122), we get a palindrome (9254334334529).
The spelling of 2213302301407 in words is "two trillion, two hundred thirteen billion, three hundred two million, three hundred one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •