Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …11110001110011011101 |
3 | 10112121012111101121202002 |
4 | 32203111103301303131 |
5 | 112341010323110123 |
6 | 2043222045212045 |
7 | 132151131323021 |
oct | 16432523616335 |
9 | 3477174347662 |
10 | 1000011144413 |
11 | 356114247956 |
12 | 141985861025 |
13 | 733ba69b278 |
14 | 36587b08381 |
15 | 1b02c718528 |
hex | e8d54f1cdd |
1000011144413 has 2 divisors, whose sum is σ = 1000011144414. Its totient is φ = 1000011144412.
The previous prime is 1000011144343. The next prime is 1000011144487. The reversal of 1000011144413 is 3144411100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 605101961689 + 394909182724 = 777883^2 + 628418^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000011144413 - 238 = 725133237469 is a prime.
It is a super-2 number, since 2×10000111444132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000011140413) 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, 500005572206 + 500005572207.
It is an arithmetic number, because the mean of its divisors is an integer number (500005572207).
Almost surely, 21000011144413 is an apocalyptic number.
It is an amenable number.
1000011144413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000011144413 is an equidigital number, since it uses as much as digits as its factorization.
1000011144413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1000011144413 its reverse (3144411100001), we get a palindrome (4144422244414).
The spelling of 1000011144413 in words is "one trillion, eleven million, one hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •