Base | Representation |
---|---|
bin | 100001100001111110001… |
… | …101110100011010001101 |
3 | 22011021121001111020011121 |
4 | 201201332031310122031 |
5 | 300223020311204123 |
6 | 4522313303520541 |
7 | 325321502012641 |
oct | 41417615643215 |
9 | 8137531436147 |
10 | 2304220022413 |
11 | 80923a14a411 |
12 | 3126a6759151 |
13 | 13939675c35a |
14 | 7d74c25ac21 |
15 | 3ee10dc375d |
hex | 2187e37468d |
2304220022413 has 8 divisors (see below), whose sum is σ = 2317613751936. Its totient is φ = 2290827150000.
The previous prime is 2304220022239. The next prime is 2304220022449. The reversal of 2304220022413 is 3142200224032.
2304220022413 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 not a de Polignac number, because 2304220022413 - 213 = 2304220014221 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 (2304220022483) 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, 5641608 + ... + 6036238.
It is an arithmetic number, because the mean of its divisors is an integer number (289701718992).
Almost surely, 22304220022413 is an apocalyptic number.
It is an amenable number.
2304220022413 is a deficient number, since it is larger than the sum of its proper divisors (13393729523).
2304220022413 is a wasteful number, since it uses less digits than its factorization.
2304220022413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428555.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 2304220022413 its reverse (3142200224032), we get a palindrome (5446420246445).
The spelling of 2304220022413 in words is "two trillion, three hundred four billion, two hundred twenty million, twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •