Base | Representation |
---|---|
bin | 101111000010101000… |
… | …0110000100111111001 |
3 | 100122202020222021021221 |
4 | 1132011100300213321 |
5 | 3123342110323001 |
6 | 114224041232041 |
7 | 10204240632340 |
oct | 1360520604771 |
9 | 318666867257 |
10 | 101020011001 |
11 | 3992a1874a8 |
12 | 176b3492621 |
13 | 96abc35050 |
14 | 4c646dab57 |
15 | 2963a701a1 |
hex | 17854309f9 |
101020011001 has 8 divisors (see below), whose sum is σ = 124332321344. Its totient is φ = 79927920720.
The previous prime is 101020010981. The next prime is 101020011011. The reversal of 101020011001 is 100110020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101020011001 - 29 = 101020010489 is a prime.
It is a super-2 number, since 2×1010200110012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (101020011011) 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, 555054915 + ... + 555055096.
It is an arithmetic number, because the mean of its divisors is an integer number (15541540168).
Almost surely, 2101020011001 is an apocalyptic number.
It is an amenable number.
101020011001 is a deficient number, since it is larger than the sum of its proper divisors (23312310343).
101020011001 is a wasteful number, since it uses less digits than its factorization.
101020011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1110110031.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101020011001 its reverse (100110020101), we get a palindrome (201130031102).
It can be divided in two parts, 1010200 and 11001, that added together give a palindrome (1021201).
The spelling of 101020011001 in words is "one hundred one billion, twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •