Base | Representation |
---|---|
bin | 11001000011101001101000… |
… | …010000101111101110010101 |
3 | 112110012012200021000020020112 |
4 | 121003221220100233232111 |
5 | 103421022214121213023 |
6 | 1030214035323412405 |
7 | 32132555535165101 |
oct | 3103515020575625 |
9 | 473165607006215 |
10 | 110202020101013 |
11 | 32128461428165 |
12 | 10439a81684105 |
13 | 496500cc85079 |
14 | 1d2db40430901 |
15 | cb191a1ba478 |
hex | 643a6842fb95 |
110202020101013 has 2 divisors, whose sum is σ = 110202020101014. Its totient is φ = 110202020101012.
The previous prime is 110202020101009. The next prime is 110202020101073. The reversal of 110202020101013 is 310101020202011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92982781846564 + 17219238254449 = 9642758^2 + 4149607^2 .
It is a cyclic number.
It is not a de Polignac number, because 110202020101013 - 22 = 110202020101009 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110202020101073) 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 as a sum of consecutive naturals, namely, 55101010050506 + 55101010050507.
It is an arithmetic number, because the mean of its divisors is an integer number (55101010050507).
Almost surely, 2110202020101013 is an apocalyptic number.
It is an amenable number.
110202020101013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110202020101013 is an equidigital number, since it uses as much as digits as its factorization.
110202020101013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 110202020101013 its reverse (310101020202011), we get a palindrome (420303040303024).
The spelling of 110202020101013 in words is "one hundred ten trillion, two hundred two billion, twenty million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •