Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0011111010011010010101 |
3 | 1022110001110020100200210021 |
4 | 2101223211103322122111 |
5 | 2303010233434032013 |
6 | 33143013454425141 |
7 | 2052164624324116 |
oct | 221534523723225 |
9 | 38401406320707 |
10 | 10011121002133 |
11 | 320a7688a8579 |
12 | 11582802021b1 |
13 | 57807716ac64 |
14 | 2687800da20d |
15 | 12562b434a8d |
hex | 91ae54fa695 |
10011121002133 has 2 divisors, whose sum is σ = 10011121002134. Its totient is φ = 10011121002132.
The previous prime is 10011121002037. The next prime is 10011121002137. The reversal of 10011121002133 is 33120012111001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7234475331204 + 2776645670929 = 2689698^2 + 1666327^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011121002133 - 29 = 10011121001621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011121002137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005560501066 + 5005560501067.
It is an arithmetic number, because the mean of its divisors is an integer number (5005560501067).
Almost surely, 210011121002133 is an apocalyptic number.
It is an amenable number.
10011121002133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011121002133 is an equidigital number, since it uses as much as digits as its factorization.
10011121002133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10011121002133 its reverse (33120012111001), we get a palindrome (43131133113134).
The spelling of 10011121002133 in words is "ten trillion, eleven billion, one hundred twenty-one million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •