Base | Representation |
---|---|
bin | 11011010010001111101111… |
… | …000100011110011101100111 |
3 | 120201212222211010210011002002 |
4 | 123102033233010132131213 |
5 | 111212044224131222134 |
6 | 1103115424553035515 |
7 | 34163536115626106 |
oct | 3322175704363547 |
9 | 521788733704062 |
10 | 120001102210919 |
11 | 352661aa859626 |
12 | 115610263b5b9b |
13 | 51c60948a2a97 |
14 | 218c1275c603d |
15 | dd17862c687e |
hex | 6d23ef11e767 |
120001102210919 has 2 divisors, whose sum is σ = 120001102210920. Its totient is φ = 120001102210918.
The previous prime is 120001102210907. The next prime is 120001102211021. The reversal of 120001102210919 is 919012201100021.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120001102210919 is a prime.
It is a super-2 number, since 2×1200011022109192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120001102210891 and 120001102210900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120001102210019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60000551105459 + 60000551105460.
It is an arithmetic number, because the mean of its divisors is an integer number (60000551105460).
Almost surely, 2120001102210919 is an apocalyptic number.
120001102210919 is a deficient number, since it is larger than the sum of its proper divisors (1).
120001102210919 is an equidigital number, since it uses as much as digits as its factorization.
120001102210919 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 29.
It can be divided in two parts, 120001102 and 210919, that added together give a palindrome (120212021).
The spelling of 120001102210919 in words is "one hundred twenty trillion, one billion, one hundred two million, two hundred ten thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •