Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …001000000110100110101011 |
3 | 112102110222211112001122002211 |
4 | 121000232123020012212223 |
5 | 103404224032030314124 |
6 | 1025541433311505551 |
7 | 32112211400462644 |
oct | 3100563310064653 |
9 | 472428745048084 |
10 | 110001010010539 |
11 | 3206019148104a |
12 | 10406b238282b7 |
13 | 494c087604c2b |
14 | 1d241121366cb |
15 | cab5a321ee94 |
hex | 640b9b2069ab |
110001010010539 has 2 divisors, whose sum is σ = 110001010010540. Its totient is φ = 110001010010538.
The previous prime is 110001010010537. The next prime is 110001010010561. The reversal of 110001010010539 is 935010010100011.
It is an a-pointer prime, because the next prime (110001010010561) can be obtained adding 110001010010539 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110001010010539 - 21 = 110001010010537 is a prime.
Together with 110001010010537, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110001010010537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000505005269 + 55000505005270.
It is an arithmetic number, because the mean of its divisors is an integer number (55000505005270).
Almost surely, 2110001010010539 is an apocalyptic number.
110001010010539 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001010010539 is an equidigital number, since it uses as much as digits as its factorization.
110001010010539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 22.
The spelling of 110001010010539 in words is "one hundred ten trillion, one billion, ten million, ten thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •