Base | Representation |
---|---|
bin | 100000001101010011000… |
… | …110001111001011111011 |
3 | 21211120220211202110112102 |
4 | 200031103012033023323 |
5 | 242230320342121220 |
6 | 4412435501334015 |
7 | 315622460103011 |
oct | 40152306171373 |
9 | 7746824673472 |
10 | 2213302301435 |
11 | 7837244a2a35 |
12 | 2b8b5256730b |
13 | 13093777a714 |
14 | 791a550c8b1 |
15 | 3c88e1b9775 |
hex | 2035318f2fb |
2213302301435 has 64 divisors (see below), whose sum is σ = 2935800806400. Its totient is φ = 1596072242688.
The previous prime is 2213302301429. The next prime is 2213302301471. The reversal of 2213302301435 is 5341032033122.
It is a happy number.
2213302301435 is digitally balanced in base 2, 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 2213302301435 - 228 = 2213033865979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 2213302301398 and 2213302301407.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 232167929 + ... + 232177461.
It is an arithmetic number, because the mean of its divisors is an integer number (45871887600).
Almost surely, 22213302301435 is an apocalyptic number.
2213302301435 is a deficient number, since it is larger than the sum of its proper divisors (722498504965).
2213302301435 is a wasteful number, since it uses less digits than its factorization.
2213302301435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11252.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 2213302301435 its reverse (5341032033122), we get a palindrome (7554334334557).
The spelling of 2213302301435 in words is "two trillion, two hundred thirteen billion, three hundred two million, three hundred one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •