Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1000010100000111011001 |
3 | 1022202120010100021021100002 |
4 | 2102332130320110013121 |
5 | 2310440001112333144 |
6 | 33251531050022345 |
7 | 2061464616341021 |
oct | 222763470240731 |
9 | 38676110237302 |
10 | 10100100121049 |
11 | 3244479233594 |
12 | 11715731179b5 |
13 | 583587621893 |
14 | 26cbc15b2a81 |
15 | 127ad7d5814e |
hex | 92f9ce141d9 |
10100100121049 has 2 divisors, whose sum is σ = 10100100121050. Its totient is φ = 10100100121048.
The previous prime is 10100100121021. The next prime is 10100100121103. The reversal of 10100100121049 is 94012100100101.
10100100121049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7948773893449 + 2151326227600 = 2819357^2 + 1466740^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100100121049 - 28 = 10100100120793 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10100100121049.
It is not a weakly prime, because it can be changed into another prime (10100100121249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050050060524 + 5050050060525.
It is an arithmetic number, because the mean of its divisors is an integer number (5050050060525).
Almost surely, 210100100121049 is an apocalyptic number.
It is an amenable number.
10100100121049 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100100121049 is an equidigital number, since it uses as much as digits as its factorization.
10100100121049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 10100100121049 in words is "ten trillion, one hundred billion, one hundred million, one hundred twenty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •