Base | Representation |
---|---|
bin | 11101000111011101000… |
… | …01000010100111100101 |
3 | 10112122021222011112021122 |
4 | 32203232201002213211 |
5 | 112342342104122212 |
6 | 2043332033423325 |
7 | 132164455062323 |
oct | 16435641024745 |
9 | 3478258145248 |
10 | 1000434051557 |
11 | 356310a39296 |
12 | 141a8340ab45 |
13 | 734571a0295 |
14 | 365c7d52d13 |
15 | 1b054904272 |
hex | e8ee8429e5 |
1000434051557 has 2 divisors, whose sum is σ = 1000434051558. Its totient is φ = 1000434051556.
The previous prime is 1000434051389. The next prime is 1000434051563. The reversal of 1000434051557 is 7551504340001.
It is a happy number.
1000434051557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 583575294241 + 416858757316 = 763921^2 + 645646^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000434051557 - 222 = 1000429857253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000434011557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500217025778 + 500217025779.
It is an arithmetic number, because the mean of its divisors is an integer number (500217025779).
Almost surely, 21000434051557 is an apocalyptic number.
It is an amenable number.
1000434051557 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000434051557 is an equidigital number, since it uses as much as digits as its factorization.
1000434051557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42000, while the sum is 35.
Adding to 1000434051557 its reverse (7551504340001), we get a palindrome (8551938391558).
The spelling of 1000434051557 in words is "one trillion, four hundred thirty-four million, fifty-one thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •