Base | Representation |
---|---|
bin | 1001001101110001000110… |
… | …0110101110000111001001 |
3 | 1022212121210002100221220011 |
4 | 2103130101212232013021 |
5 | 2312001042020324111 |
6 | 33314344432031521 |
7 | 2064010313212615 |
oct | 223342146560711 |
9 | 38777702327804 |
10 | 10132123214281 |
11 | 32570114574a2 |
12 | 117780b6925a1 |
13 | 5865bbb88363 |
14 | 27057c5a8345 |
15 | 12885e3a7021 |
hex | 937119ae1c9 |
10132123214281 has 2 divisors, whose sum is σ = 10132123214282. Its totient is φ = 10132123214280.
The previous prime is 10132123214183. The next prime is 10132123214293. The reversal of 10132123214281 is 18241232123101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10122044058256 + 10079156025 = 3181516^2 + 100395^2 .
It is a cyclic number.
It is not a de Polignac number, because 10132123214281 - 219 = 10132122689993 is a prime.
It is a super-2 number, since 2×101321232142812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10132123214581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066061607140 + 5066061607141.
It is an arithmetic number, because the mean of its divisors is an integer number (5066061607141).
Almost surely, 210132123214281 is an apocalyptic number.
It is an amenable number.
10132123214281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10132123214281 is an equidigital number, since it uses as much as digits as its factorization.
10132123214281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 31.
Adding to 10132123214281 its reverse (18241232123101), we get a palindrome (28373355337382).
The spelling of 10132123214281 in words is "ten trillion, one hundred thirty-two billion, one hundred twenty-three million, two hundred fourteen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •