Base | Representation |
---|---|
bin | 101111000010101110… |
… | …1010011100110100001 |
3 | 100122202111011100221202 |
4 | 1132011131103212201 |
5 | 3123343431100001 |
6 | 114224235530545 |
7 | 10204310611301 |
oct | 1360535234641 |
9 | 318674140852 |
10 | 101023300001 |
11 | 39931023588 |
12 | 176b45b9a55 |
13 | 96ac8170c0 |
14 | 4c64d15601 |
15 | 2963ebe96b |
hex | 17857539a1 |
101023300001 has 8 divisors (see below), whose sum is σ = 112545851880. Its totient is φ = 90036680832.
The previous prime is 101023299959. The next prime is 101023300151. The reversal of 101023300001 is 100003320101.
It can be written as a sum of positive squares in 4 ways, for example, as 3631870225 + 97391429776 = 60265^2 + 312076^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101023300001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101023302001) 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 7 ways as a sum of consecutive naturals, for example, 133982780 + ... + 133983533.
It is an arithmetic number, because the mean of its divisors is an integer number (14068231485).
Almost surely, 2101023300001 is an apocalyptic number.
It is an amenable number.
101023300001 is a deficient number, since it is larger than the sum of its proper divisors (11522551879).
101023300001 is a wasteful number, since it uses less digits than its factorization.
101023300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267966355.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 101023300001 its reverse (100003320101), we get a palindrome (201026620102).
The spelling of 101023300001 in words is "one hundred one billion, twenty-three million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •