Base | Representation |
---|---|
bin | 101111000010010111… |
… | …1100001111010100001 |
3 | 100122201122120201001022 |
4 | 1132010233201322201 |
5 | 3123332343100001 |
6 | 114223130415225 |
7 | 10204103612003 |
oct | 1360457417241 |
9 | 318648521038 |
10 | 101011300001 |
11 | 39925277827 |
12 | 176b0591515 |
13 | 96aa1a5101 |
14 | 4c634b0373 |
15 | 2962dee11b |
hex | 1784be1ea1 |
101011300001 has 4 divisors (see below), whose sum is σ = 101631001392. Its totient is φ = 100391598612.
The previous prime is 101011299997. The next prime is 101011300021. The reversal of 101011300001 is 100003110101.
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, and also an emirpimes, since its reverse is a distinct semiprime: 100003110101 = 1019 ⋅98138479.
It is a cyclic number.
It is not a de Polignac number, because 101011300001 - 22 = 101011299997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011300021) 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 3 ways as a sum of consecutive naturals, for example, 309850451 + ... + 309850776.
It is an arithmetic number, because the mean of its divisors is an integer number (25407750348).
Almost surely, 2101011300001 is an apocalyptic number.
It is an amenable number.
101011300001 is a deficient number, since it is larger than the sum of its proper divisors (619701391).
101011300001 is an equidigital number, since it uses as much as digits as its factorization.
101011300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619701390.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 101011300001 its reverse (100003110101), we get a palindrome (201014410102).
The spelling of 101011300001 in words is "one hundred one billion, eleven million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •