Base | Representation |
---|---|
bin | 10010101010100111… |
… | …11110000111011001 |
3 | 221212101201101110222 |
4 | 21111103332013121 |
5 | 131010413424423 |
6 | 4334221445425 |
7 | 503223035033 |
oct | 112523760731 |
9 | 27771641428 |
10 | 10021233113 |
11 | 42827a7841 |
12 | 1b38110875 |
13 | c39212c48 |
14 | 6b0cccc53 |
15 | 3d9ba43c8 |
hex | 2554fe1d9 |
10021233113 has 2 divisors, whose sum is σ = 10021233114. Its totient is φ = 10021233112.
The previous prime is 10021233097. The next prime is 10021233133. The reversal of 10021233113 is 31133212001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9822197449 + 199035664 = 99107^2 + 14108^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021233113 - 24 = 10021233097 is a prime.
It is a super-2 number, since 2×100212331132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10021233091 and 10021233100.
It is not a weakly prime, because it can be changed into another prime (10021233133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010616556 + 5010616557.
It is an arithmetic number, because the mean of its divisors is an integer number (5010616557).
Almost surely, 210021233113 is an apocalyptic number.
It is an amenable number.
10021233113 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021233113 is an equidigital number, since it uses as much as digits as its factorization.
10021233113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10021233113 its reverse (31133212001), we get a palindrome (41154445114).
The spelling of 10021233113 in words is "ten billion, twenty-one million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •