Base | Representation |
---|---|
bin | 11001000010101000011011… |
… | …111100011011110010010001 |
3 | 112102221111222211220102002212 |
4 | 121002220123330123302101 |
5 | 103413400334134400223 |
6 | 1030121541315321505 |
7 | 32124530062130243 |
oct | 3102503374336221 |
9 | 472844884812085 |
10 | 110132020231313 |
11 | 32100800314a83 |
12 | 104283a68b0295 |
13 | 495b535884b22 |
14 | 1d2a5bd850093 |
15 | caebbead3278 |
hex | 642a1bf1bc91 |
110132020231313 has 16 divisors (see below), whose sum is σ = 110827005184896. Its totient is φ = 109438010478720.
The previous prime is 110132020231309. The next prime is 110132020231451. The reversal of 110132020231313 is 313132020231011.
It is a cyclic number.
It is not a de Polignac number, because 110132020231313 - 22 = 110132020231309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110132020261313) 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 in 15 ways as a sum of consecutive naturals, for example, 1832358020 + ... + 1832418122.
It is an arithmetic number, because the mean of its divisors is an integer number (6926687824056).
Almost surely, 2110132020231313 is an apocalyptic number.
It is an amenable number.
110132020231313 is a deficient number, since it is larger than the sum of its proper divisors (694984953583).
110132020231313 is a wasteful number, since it uses less digits than its factorization.
110132020231313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68024.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 110132020231313 its reverse (313132020231011), we get a palindrome (423264040462324).
The spelling of 110132020231313 in words is "one hundred ten trillion, one hundred thirty-two billion, twenty million, two hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •