Base | Representation |
---|---|
bin | 10011010001111101… |
… | …01111101000101001 |
3 | 222201101122002220212 |
4 | 21220332233220221 |
5 | 132144402304342 |
6 | 4431050230505 |
7 | 514340600561 |
oct | 115076575051 |
9 | 28641562825 |
10 | 10351213097 |
11 | 4431a98675 |
12 | 200a725435 |
13 | c8c6a9884 |
14 | 702a67da1 |
15 | 408b36182 |
hex | 268fafa29 |
10351213097 has 2 divisors, whose sum is σ = 10351213098. Its totient is φ = 10351213096.
The previous prime is 10351213021. The next prime is 10351213127. The reversal of 10351213097 is 79031215301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9812091136 + 539121961 = 99056^2 + 23219^2 .
It is an emirp because it is prime and its reverse (79031215301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10351213097 - 222 = 10347018793 is a prime.
It is a super-2 number, since 2×103512130972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10351213597) 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, 5175606548 + 5175606549.
It is an arithmetic number, because the mean of its divisors is an integer number (5175606549).
Almost surely, 210351213097 is an apocalyptic number.
It is an amenable number.
10351213097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10351213097 is an equidigital number, since it uses as much as digits as its factorization.
10351213097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 32.
Adding to 10351213097 its reverse (79031215301), we get a palindrome (89382428398).
The spelling of 10351213097 in words is "ten billion, three hundred fifty-one million, two hundred thirteen thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •