Base | Representation |
---|---|
bin | 10001011101100110001… |
… | …010111001111000000001 |
3 | 11020201102202112200021101 |
4 | 101131212022321320001 |
5 | 124130110030310423 |
6 | 2315135455054401 |
7 | 152461236534025 |
oct | 21354612717001 |
9 | 4221382480241 |
10 | 1200010010113 |
11 | 422a15403912 |
12 | 1746a0b11401 |
13 | 892116b1055 |
14 | 4211b9b2385 |
15 | 21335a167ad |
hex | 117662b9e01 |
1200010010113 has 2 divisors, whose sum is σ = 1200010010114. Its totient is φ = 1200010010112.
The previous prime is 1200010010083. The next prime is 1200010010183. The reversal of 1200010010113 is 3110100100021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 621593481744 + 578416528369 = 788412^2 + 760537^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1200010010113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1200010010113.
It is not a weakly prime, because it can be changed into another prime (1200010010183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600005005056 + 600005005057.
It is an arithmetic number, because the mean of its divisors is an integer number (600005005057).
Almost surely, 21200010010113 is an apocalyptic number.
It is an amenable number.
1200010010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200010010113 is an equidigital number, since it uses as much as digits as its factorization.
1200010010113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1200010010113 its reverse (3110100100021), we get a palindrome (4310110110134).
The spelling of 1200010010113 in words is "one trillion, two hundred billion, ten million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •