Base | Representation |
---|---|
bin | 100001110000110111001… |
… | …110010101101100100011 |
3 | 22012210212100021121021021 |
4 | 201300313032111230203 |
5 | 301003241431024403 |
6 | 4533520023510311 |
7 | 326425636532545 |
oct | 41606716255443 |
9 | 8183770247237 |
10 | 2320208845603 |
11 | 814aa4450980 |
12 | 3158092b8397 |
13 | 13aa4410118c |
14 | 8042791d695 |
15 | 4054990c8bd |
hex | 21c37395b23 |
2320208845603 has 64 divisors (see below), whose sum is σ = 2712600576000. Its totient is φ = 1963961112960.
The previous prime is 2320208845601. The next prime is 2320208845613. The reversal of 2320208845603 is 3065488020232.
2320208845603 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2320208845603 - 21 = 2320208845601 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 2320208845603.
It is not an unprimeable number, because it can be changed into a prime (2320208845601) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 397361158 + ... + 397366996.
It is an arithmetic number, because the mean of its divisors is an integer number (42384384000).
Almost surely, 22320208845603 is an apocalyptic number.
2320208845603 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2320208845603 is a deficient number, since it is larger than the sum of its proper divisors (392391730397).
2320208845603 is a wasteful number, since it uses less digits than its factorization.
2320208845603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6232.
The product of its (nonzero) digits is 552960, while the sum is 43.
The spelling of 2320208845603 in words is "two trillion, three hundred twenty billion, two hundred eight million, eight hundred forty-five thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •