Base | Representation |
---|---|
bin | 10000010101111110000… |
… | …110010000000010001101 |
3 | 10222100220220121120221001 |
4 | 100111332012100002031 |
5 | 121400103110011023 |
6 | 2215540154140301 |
7 | 144066341521363 |
oct | 20257606200215 |
9 | 3870826546831 |
10 | 1123102032013 |
11 | 3a33398aa635 |
12 | 1617b8721691 |
13 | 81ba603cac0 |
14 | 3c503755633 |
15 | 1e333c176ad |
hex | 1057e19008d |
1123102032013 has 16 divisors (see below), whose sum is σ = 1262939682816. Its totient is φ = 990960727680.
The previous prime is 1123102032007. The next prime is 1123102032029. The reversal of 1123102032013 is 3102302013211.
It is a cyclic number.
It is not a de Polignac number, because 1123102032013 - 29 = 1123102031501 is a prime.
It is a super-2 number, since 2×11231020320132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123102032043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 836920 + ... + 1716577.
It is an arithmetic number, because the mean of its divisors is an integer number (78933730176).
Almost surely, 21123102032013 is an apocalyptic number.
1123102032013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1123102032013 is a deficient number, since it is larger than the sum of its proper divisors (139837650803).
1123102032013 is a wasteful number, since it uses less digits than its factorization.
1123102032013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2555004.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1123102032013 its reverse (3102302013211), we get a palindrome (4225404045224).
The spelling of 1123102032013 in words is "one trillion, one hundred twenty-three billion, one hundred two million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •