Base | Representation |
---|---|
bin | 1001010011011110100000… |
… | …0010111101100000010001 |
3 | 1100012222221221101020012111 |
4 | 2110313220002331200101 |
5 | 2320102432304101342 |
6 | 33431405501025321 |
7 | 2104052101060465 |
oct | 224675002754021 |
9 | 40188857336174 |
10 | 10230210222097 |
11 | 3294675a73218 |
12 | 1192824855241 |
13 | 592921265758 |
14 | 27520553c4a5 |
15 | 12b1a06b9217 |
hex | 94de80bd811 |
10230210222097 has 2 divisors, whose sum is σ = 10230210222098. Its totient is φ = 10230210222096.
The previous prime is 10230210221971. The next prime is 10230210222139. The reversal of 10230210222097 is 79022201203201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9964275077376 + 265935144721 = 3156624^2 + 515689^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10230210222097 is a prime.
It is not a weakly prime, because it can be changed into another prime (10230210222497) 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, 5115105111048 + 5115105111049.
It is an arithmetic number, because the mean of its divisors is an integer number (5115105111049).
Almost surely, 210230210222097 is an apocalyptic number.
It is an amenable number.
10230210222097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10230210222097 is an equidigital number, since it uses as much as digits as its factorization.
10230210222097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
Adding to 10230210222097 its reverse (79022201203201), we get a palindrome (89252411425298).
The spelling of 10230210222097 in words is "ten trillion, two hundred thirty billion, two hundred ten million, two hundred twenty-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •