Base | Representation |
---|---|
bin | 110111111000010011… |
… | …1110111110011011101 |
3 | 102110202002020112211000 |
4 | 1233300213313303131 |
5 | 3431230240213041 |
6 | 131043332020513 |
7 | 11445511346244 |
oct | 1576047676335 |
9 | 373662215730 |
10 | 120001101021 |
11 | 4698a54735a |
12 | 1b310161739 |
13 | b4154b1569 |
14 | 5b4555195b |
15 | 31c5121bb6 |
hex | 1bf09f7cdd |
120001101021 has 8 divisors (see below), whose sum is σ = 177779408960. Its totient is φ = 80000733996.
The previous prime is 120001100983. The next prime is 120001101067. The reversal of 120001101021 is 120101100021.
It is a happy number.
It is not a de Polignac number, because 120001101021 - 29 = 120001100509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 120001100994 and 120001101012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120001101421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2222242585 + ... + 2222242638.
It is an arithmetic number, because the mean of its divisors is an integer number (22222426120).
Almost surely, 2120001101021 is an apocalyptic number.
It is an amenable number.
120001101021 is a deficient number, since it is larger than the sum of its proper divisors (57778307939).
120001101021 is an equidigital number, since it uses as much as digits as its factorization.
120001101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4444485232 (or 4444485226 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 120001101021 its reverse (120101100021), we get a palindrome (240102201042).
The spelling of 120001101021 in words is "one hundred twenty billion, one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •