Base | Representation |
---|---|
bin | 1001110101010110011010… |
… | …1111011100011110010001 |
3 | 1102021122001202202222010212 |
4 | 2131111212233130132101 |
5 | 2404121244014204312 |
6 | 34555011443133505 |
7 | 2164103212666322 |
oct | 235254657343621 |
9 | 42248052688125 |
10 | 10812156397457 |
11 | 3499456461088 |
12 | 1267575374295 |
13 | 60577479848c |
14 | 29544db84449 |
15 | 13b3b059a822 |
hex | 9d566bdc791 |
10812156397457 has 2 divisors, whose sum is σ = 10812156397458. Its totient is φ = 10812156397456.
The previous prime is 10812156397439. The next prime is 10812156397571. The reversal of 10812156397457 is 75479365121801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8316527377921 + 2495629019536 = 2883839^2 + 1579756^2 .
It is a cyclic number.
It is not a de Polignac number, because 10812156397457 - 212 = 10812156393361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10812156397396 and 10812156397405.
It is not a weakly prime, because it can be changed into another prime (10812156397957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5406078198728 + 5406078198729.
It is an arithmetic number, because the mean of its divisors is an integer number (5406078198729).
It is a 1-persistent number, because it is pandigital, but 2⋅10812156397457 = 21624312794914 is not.
Almost surely, 210812156397457 is an apocalyptic number.
It is an amenable number.
10812156397457 is a deficient number, since it is larger than the sum of its proper divisors (1).
10812156397457 is an equidigital number, since it uses as much as digits as its factorization.
10812156397457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12700800, while the sum is 59.
The spelling of 10812156397457 in words is "ten trillion, eight hundred twelve billion, one hundred fifty-six million, three hundred ninety-seven thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •