Base | Representation |
---|---|
bin | 11011010011110101001011… |
… | …001000110000110101001001 |
3 | 120202021101221212201222201010 |
4 | 123103311023020300311021 |
5 | 111220340310340133001 |
6 | 1103241440521114133 |
7 | 34204443201345264 |
oct | 3323651310606511 |
9 | 522241855658633 |
10 | 120110021021001 |
11 | 352a8412671750 |
12 | 1157a163028949 |
13 | 52034320a692b |
14 | 21934dad65cdb |
15 | dd450d5018d6 |
hex | 6d3d4b230d49 |
120110021021001 has 32 divisors (see below), whose sum is σ = 178056542742912. Its totient is φ = 71398522690560.
The previous prime is 120110021020943. The next prime is 120110021021033. The reversal of 120110021021001 is 100120120011021.
It is not a de Polignac number, because 120110021021001 - 242 = 115711974509897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120110021021051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4865920 + ... + 16244913.
It is an arithmetic number, because the mean of its divisors is an integer number (5564266960716).
Almost surely, 2120110021021001 is an apocalyptic number.
120110021021001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120110021021001 is a deficient number, since it is larger than the sum of its proper divisors (57946521721911).
120110021021001 is a wasteful number, since it uses less digits than its factorization.
120110021021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21114153.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120110021021001 its reverse (100120120011021), we get a palindrome (220230141032022).
The spelling of 120110021021001 in words is "one hundred twenty trillion, one hundred ten billion, twenty-one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •