Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1111100011101101001 |
3 | 100200012212220200020200 |
4 | 1132100003330131221 |
5 | 3124230001413001 |
6 | 114254032542413 |
7 | 10211601005145 |
oct | 1362003743551 |
9 | 320185820220 |
10 | 101201201001 |
11 | 39a124921aa |
12 | 177440b1a09 |
13 | 970a634774 |
14 | 4c807c4225 |
15 | 2974911086 |
hex | 17900fc769 |
101201201001 has 24 divisors (see below), whose sum is σ = 151380303360. Its totient is φ = 65081102400.
The previous prime is 101201200999. The next prime is 101201201027. The reversal of 101201201001 is 100102102101.
It is a happy number.
It is not a de Polignac number, because 101201201001 - 21 = 101201200999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101201201041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 496396 + ... + 669933.
It is an arithmetic number, because the mean of its divisors is an integer number (6307512640).
Almost surely, 2101201201001 is an apocalyptic number.
It is an amenable number.
101201201001 is a deficient number, since it is larger than the sum of its proper divisors (50179102359).
101201201001 is a wasteful number, since it uses less digits than its factorization.
101201201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1166677 (or 1166674 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101201201001 its reverse (100102102101), we get a palindrome (201303303102).
It can be divided in two parts, 10120 and 1201001, that added together give a palindrome (1211121).
The spelling of 101201201001 in words is "one hundred one billion, two hundred one million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •