Base | Representation |
---|---|
bin | 1001100010101110001001… |
… | …0101011010011110000101 |
3 | 1101011000222000010101202212 |
4 | 2120223202111122132011 |
5 | 2333400313443313333 |
6 | 34152001350313205 |
7 | 2132013126262343 |
oct | 230534225323605 |
9 | 41130860111685 |
10 | 10492107401093 |
11 | 33857501100aa |
12 | 1215535658805 |
13 | 5b152b098616 |
14 | 283b6c044993 |
15 | 132dccbe3448 |
hex | 98ae255a785 |
10492107401093 has 2 divisors, whose sum is σ = 10492107401094. Its totient is φ = 10492107401092.
The previous prime is 10492107401089. The next prime is 10492107401129. The reversal of 10492107401093 is 39010470129401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10269929036929 + 222178364164 = 3204673^2 + 471358^2 .
It is a cyclic number.
It is not a de Polignac number, because 10492107401093 - 22 = 10492107401089 is a prime.
It is a super-2 number, since 2×104921074010932 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10492107401093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10492107401033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5246053700546 + 5246053700547.
It is an arithmetic number, because the mean of its divisors is an integer number (5246053700547).
Almost surely, 210492107401093 is an apocalyptic number.
It is an amenable number.
10492107401093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10492107401093 is an equidigital number, since it uses as much as digits as its factorization.
10492107401093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 41.
The spelling of 10492107401093 in words is "ten trillion, four hundred ninety-two billion, one hundred seven million, four hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •