Base | Representation |
---|---|
bin | 11011010010001111101111… |
… | …101010001100110100001110 |
3 | 120201212222211211101120111102 |
4 | 123102033233222030310032 |
5 | 111212044234144200420 |
6 | 1103115425545023102 |
7 | 34163536265654423 |
oct | 3322175752146416 |
9 | 521788754346442 |
10 | 120001112100110 |
11 | 352662053a350a |
12 | 11561029784a92 |
13 | 51c6096956087 |
14 | 218c128a3bd4a |
15 | dd17870cba75 |
hex | 6d23efa8cd0e |
120001112100110 has 8 divisors (see below), whose sum is σ = 216002001780216. Its totient is φ = 48000444840040.
The previous prime is 120001112100047. The next prime is 120001112100119. The reversal of 120001112100110 is 11001211100021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 120001112100091 and 120001112100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120001112100119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6000055604996 + ... + 6000055605015.
It is an arithmetic number, because the mean of its divisors is an integer number (27000250222527).
Almost surely, 2120001112100110 is an apocalyptic number.
120001112100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120001112100110 is a deficient number, since it is larger than the sum of its proper divisors (96000889680106).
120001112100110 is a wasteful number, since it uses less digits than its factorization.
120001112100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12000111210018.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 120001112100110 its reverse (11001211100021), we get a palindrome (131002323200131).
The spelling of 120001112100110 in words is "one hundred twenty trillion, one billion, one hundred twelve million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •