Base | Representation |
---|---|
bin | 11001000010100110101011… |
… | …010010001110111000010011 |
3 | 112102221100010010022211002222 |
4 | 121002212223102032320103 |
5 | 103413333001302321321 |
6 | 1030121025555531255 |
7 | 32124432201345245 |
oct | 3102465322167023 |
9 | 472840103284088 |
10 | 110130130120211 |
11 | 320aaa20403593 |
12 | 10427b598b9b2b |
13 | 495b2c41043a6 |
14 | 1d2a4807dc095 |
15 | caeb0dbca3ab |
hex | 6429ab48ee13 |
110130130120211 has 2 divisors, whose sum is σ = 110130130120212. Its totient is φ = 110130130120210.
The previous prime is 110130130120201. The next prime is 110130130120261. The reversal of 110130130120211 is 112021031031011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110130130120211 is a prime.
It is a super-2 number, since 2×1101301301202112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110130130120211.
It is not a weakly prime, because it can be changed into another prime (110130130120201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065065060105 + 55065065060106.
It is an arithmetic number, because the mean of its divisors is an integer number (55065065060106).
Almost surely, 2110130130120211 is an apocalyptic number.
110130130120211 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130130120211 is an equidigital number, since it uses as much as digits as its factorization.
110130130120211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 110130130120211 its reverse (112021031031011), we get a palindrome (222151161151222).
The spelling of 110130130120211 in words is "one hundred ten trillion, one hundred thirty billion, one hundred thirty million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •