Base | Representation |
---|---|
bin | 101111000111111111… |
… | …1011001101100010001 |
3 | 100200012210200011111120 |
4 | 1132033333121230101 |
5 | 3124224200310001 |
6 | 114253551232453 |
7 | 10211554614636 |
oct | 1361777315421 |
9 | 320183604446 |
10 | 101200010001 |
11 | 39a11849402 |
12 | 17743818729 |
13 | 970a30862c |
14 | 4c8059418d |
15 | 2974778236 |
hex | 178ffd9b11 |
101200010001 has 4 divisors (see below), whose sum is σ = 134933346672. Its totient is φ = 67466673332.
The previous prime is 101200009979. The next prime is 101200010017. The reversal of 101200010001 is 100010002101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101200010001 - 25 = 101200009969 is a prime.
101200010001 is a modest number, since divided by 10001 gives 1012 as remainder.
It is not an unprimeable number, because it can be changed into a prime (101200010201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16866668331 + ... + 16866668336.
It is an arithmetic number, because the mean of its divisors is an integer number (33733336668).
Almost surely, 2101200010001 is an apocalyptic number.
It is an amenable number.
101200010001 is a deficient number, since it is larger than the sum of its proper divisors (33733336671).
101200010001 is an equidigital number, since it uses as much as digits as its factorization.
101200010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33733336670.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 101200010001 its reverse (100010002101), we get a palindrome (201210012102).
The spelling of 101200010001 in words is "one hundred one billion, two hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •