Base | Representation |
---|---|
bin | 1001101011011001001101… |
… | …1111001010100000000111 |
3 | 1101200021120010211000211001 |
4 | 2122312103133022200013 |
5 | 2343320442223144143 |
6 | 34344242511154131 |
7 | 2145536405054236 |
oct | 232662337124007 |
9 | 41607503730731 |
10 | 10641108412423 |
11 | 3432961316285 |
12 | 123a399815947 |
13 | 5c25b56a3008 |
14 | 28b064c6cb1d |
15 | 136bedc4114d |
hex | 9ad937ca807 |
10641108412423 has 2 divisors, whose sum is σ = 10641108412424. Its totient is φ = 10641108412422.
The previous prime is 10641108412393. The next prime is 10641108412453. The reversal of 10641108412423 is 32421480114601.
10641108412423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10641108412393) and next prime (10641108412453).
It is a cyclic number.
It is not a de Polignac number, because 10641108412423 - 229 = 10640571541511 is a prime.
It is a super-2 number, since 2×106411084124232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10641108412453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5320554206211 + 5320554206212.
It is an arithmetic number, because the mean of its divisors is an integer number (5320554206212).
Almost surely, 210641108412423 is an apocalyptic number.
10641108412423 is a deficient number, since it is larger than the sum of its proper divisors (1).
10641108412423 is an equidigital number, since it uses as much as digits as its factorization.
10641108412423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36864, while the sum is 37.
The spelling of 10641108412423 in words is "ten trillion, six hundred forty-one billion, one hundred eight million, four hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •