Base | Representation |
---|---|
bin | 100001011110001110110… |
… | …100101000011111011000 |
3 | 22010220020011000011001222 |
4 | 201132032310220133120 |
5 | 300141304114242433 |
6 | 4520410551231212 |
7 | 325120122362120 |
oct | 41361664503730 |
9 | 8126204004058 |
10 | 2300203665368 |
11 | 807569003974 |
12 | 311965678508 |
13 | 138ba663171b |
14 | 7d48aa89c80 |
15 | 3ec784bbb98 |
hex | 2178ed287d8 |
2300203665368 has 32 divisors (see below), whose sum is σ = 5143312546560. Its totient is φ = 942940632480.
The previous prime is 2300203665367. The next prime is 2300203665373. The reversal of 2300203665368 is 8635663020032.
2300203665368 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300203665367) 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, 892934918 + ... + 892937493.
It is an arithmetic number, because the mean of its divisors is an integer number (160728517080).
Almost surely, 22300203665368 is an apocalyptic number.
2300203665368 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
2300203665368 is an abundant number, since it is smaller than the sum of its proper divisors (2843108881192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2300203665368 is a wasteful number, since it uses less digits than its factorization.
2300203665368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1785872447 (or 1785872443 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 44.
The spelling of 2300203665368 in words is "two trillion, three hundred billion, two hundred three million, six hundred sixty-five thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •