Base | Representation |
---|---|
bin | 101111000010011001… |
… | …0001101000011111101 |
3 | 100122201200220022200000 |
4 | 1132010302031003331 |
5 | 3123333033013041 |
6 | 114223153424513 |
7 | 10204112561541 |
oct | 1360462150375 |
9 | 318650808600 |
10 | 101012001021 |
11 | 39925706488 |
12 | 176b086b139 |
13 | 96aa38c209 |
14 | 4c63613a21 |
15 | 2962edbbb6 |
hex | 1784c8d0fd |
101012001021 has 48 divisors (see below), whose sum is σ = 165735460800. Its totient is φ = 61194486528.
The previous prime is 101012001007. The next prime is 101012001037. The reversal of 101012001021 is 120100210101.
It is a happy number.
It is not a de Polignac number, because 101012001021 - 226 = 100944892157 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101012000994 and 101012001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101012001091) 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 47 ways as a sum of consecutive naturals, for example, 301791 + ... + 541388.
It is an arithmetic number, because the mean of its divisors is an integer number (3452822100).
Almost surely, 2101012001021 is an apocalyptic number.
It is an amenable number.
101012001021 is a deficient number, since it is larger than the sum of its proper divisors (64723459779).
101012001021 is an equidigital number, since it uses as much as digits as its factorization.
101012001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843240 (or 843228 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101012001021 its reverse (120100210101), we get a palindrome (221112211122).
The spelling of 101012001021 in words is "one hundred one billion, twelve million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •