Base | Representation |
---|---|
bin | 101111000010101110… |
… | …1010110100010010101 |
3 | 100122202111011222102221 |
4 | 1132011131112202111 |
5 | 3123343431441041 |
6 | 114224240102341 |
7 | 10204310661322 |
oct | 1360535264225 |
9 | 318674158387 |
10 | 101023312021 |
11 | 39931031615 |
12 | 176b46049b1 |
13 | 96ac81c708 |
14 | 4c64d19b49 |
15 | 2963ec32d1 |
hex | 1785756895 |
101023312021 has 8 divisors (see below), whose sum is σ = 102009054240. Its totient is φ = 100038340368.
The previous prime is 101023312001. The next prime is 101023312063. The reversal of 101023312021 is 120213320101.
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 101023312021 - 29 = 101023311509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101023311986 and 101023312004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101023312001) 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, 72615 + ... + 455323.
It is an arithmetic number, because the mean of its divisors is an integer number (12751131780).
Almost surely, 2101023312021 is an apocalyptic number.
It is an amenable number.
101023312021 is a deficient number, since it is larger than the sum of its proper divisors (985742219).
101023312021 is a wasteful number, since it uses less digits than its factorization.
101023312021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385283.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101023312021 its reverse (120213320101), we get a palindrome (221236632122).
The spelling of 101023312021 in words is "one hundred one billion, twenty-three million, three hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •