Base | Representation |
---|---|
bin | 101111010101011110… |
… | …1110001101101000100 |
3 | 100201101100020112121021 |
4 | 1132222331301231010 |
5 | 3131141024201100 |
6 | 114410515200524 |
7 | 10226021402431 |
oct | 1365275615504 |
9 | 321340215537 |
10 | 101652568900 |
11 | 3a124252623 |
12 | 1784b2a6144 |
13 | 977ccbcc6c |
14 | 4cc471ab88 |
15 | 299e36ea1a |
hex | 17aaf71b44 |
101652568900 has 27 divisors (see below), whose sum is σ = 220592993341. Its totient is φ = 40659752240.
The previous prime is 101652568879. The next prime is 101652568903. The reversal of 101652568900 is 9865256101.
The square root of 101652568900 is 318830.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 36594924804 + 65057644096 = 191298^2 + 255064^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101652568903) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3172359 + ... + 3204241.
Almost surely, 2101652568900 is an apocalyptic number.
101652568900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101652568900 is the 318830-th square number.
It is an amenable number.
101652568900 is an abundant number, since it is smaller than the sum of its proper divisors (118940424441).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101652568900 is an frugal number, since it uses more digits than its factorization.
101652568900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63780 (or 31890 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 43.
The spelling of 101652568900 in words is "one hundred one billion, six hundred fifty-two million, five hundred sixty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •