Base | Representation |
---|---|
bin | 1001001110010111011011… |
… | …1000000111000010011001 |
3 | 1022220121100010220220110011 |
4 | 2103211312320013002121 |
5 | 2312133130011044413 |
6 | 33323205420521521 |
7 | 2064523300205656 |
oct | 223456670070231 |
9 | 38817303826404 |
10 | 10142412206233 |
11 | 326041130742a |
12 | 11798013b02a1 |
13 | 58756b6bac88 |
14 | 270c76c76c2d |
15 | 128c627ec33d |
hex | 93976e07099 |
10142412206233 has 2 divisors, whose sum is σ = 10142412206234. Its totient is φ = 10142412206232.
The previous prime is 10142412206219. The next prime is 10142412206261. The reversal of 10142412206233 is 33260221424101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9047871489024 + 1094540717209 = 3007968^2 + 1046203^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142412206233 - 213 = 10142412198041 is a prime.
It is a super-2 number, since 2×101424122062332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10142412206195 and 10142412206204.
It is not a weakly prime, because it can be changed into another prime (10142412206933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071206103116 + 5071206103117.
It is an arithmetic number, because the mean of its divisors is an integer number (5071206103117).
Almost surely, 210142412206233 is an apocalyptic number.
It is an amenable number.
10142412206233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142412206233 is an equidigital number, since it uses as much as digits as its factorization.
10142412206233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
The spelling of 10142412206233 in words is "ten trillion, one hundred forty-two billion, four hundred twelve million, two hundred six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •