Base | Representation |
---|---|
bin | 101111001000001011… |
… | …1001110000001100000 |
3 | 100200020020102101012100 |
4 | 1132100113032001200 |
5 | 3124232300104124 |
6 | 114254333130400 |
7 | 10211661651015 |
oct | 1362027160140 |
9 | 320206371170 |
10 | 101206253664 |
11 | 39a1532335a |
12 | 17745929a00 |
13 | 970b6b34c9 |
14 | 4c8133b70c |
15 | 29750ad1c9 |
hex | 17905ce060 |
101206253664 has 72 divisors (see below), whose sum is σ = 297729628560. Its totient is φ = 32572124928.
The previous prime is 101206253641. The next prime is 101206253669. The reversal of 101206253664 is 466352602101.
101206253664 is a `hidden beast` number, since 1 + 0 + 1 + 2 + 0 + 62 + 536 + 64 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101206253669) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6050452 + ... + 6067155.
It is an arithmetic number, because the mean of its divisors is an integer number (4135133730).
Almost surely, 2101206253664 is an apocalyptic number.
It is an amenable number.
101206253664 is an abundant number, since it is smaller than the sum of its proper divisors (196523374896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101206253664 is a wasteful number, since it uses less digits than its factorization.
101206253664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12117652 (or 12117641 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
Adding to 101206253664 its reverse (466352602101), we get a palindrome (567558855765).
The spelling of 101206253664 in words is "one hundred one billion, two hundred six million, two hundred fifty-three thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •