Base | Representation |
---|---|
bin | 10000000001011010101… |
… | …000100001111100011101 |
3 | 10220020221211100001200221 |
4 | 100001122220201330131 |
5 | 121014403220431023 |
6 | 2201450205121341 |
7 | 142355414204602 |
oct | 20013250417435 |
9 | 3806854301627 |
10 | 1101032202013 |
11 | 394a43a79707 |
12 | 159479559251 |
13 | 7ca998ab7b3 |
14 | 3b40c5d86a9 |
15 | 1d9913e385d |
hex | 1005aa21f1d |
1101032202013 has 16 divisors (see below), whose sum is σ = 1118734291584. Its totient is φ = 1083393097920.
The previous prime is 1101032202001. The next prime is 1101032202019. The reversal of 1101032202013 is 3102022301011.
It is a cyclic number.
It is not a de Polignac number, because 1101032202013 - 221 = 1101030104861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101032202019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91464631 + ... + 91476667.
It is an arithmetic number, because the mean of its divisors is an integer number (69920893224).
Almost surely, 21101032202013 is an apocalyptic number.
It is an amenable number.
1101032202013 is a deficient number, since it is larger than the sum of its proper divisors (17702089571).
1101032202013 is a wasteful number, since it uses less digits than its factorization.
1101032202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14532.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1101032202013 its reverse (3102022301011), we get a palindrome (4203054503024).
The spelling of 1101032202013 in words is "one trillion, one hundred one billion, thirty-two million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •