Base | Representation |
---|---|
bin | 11110100110000100100… |
… | …00011101100011110101 |
3 | 10201111102002210202002121 |
4 | 33103002100131203311 |
5 | 114210410131144014 |
6 | 2122532351035541 |
7 | 135643326022561 |
oct | 17230220354365 |
9 | 3644362722077 |
10 | 1051231115509 |
11 | 375908617283 |
12 | 14b89b20bbb1 |
13 | 78191105683 |
14 | 38c464866a1 |
15 | 1c529241124 |
hex | f4c241d8f5 |
1051231115509 has 2 divisors, whose sum is σ = 1051231115510. Its totient is φ = 1051231115508.
The previous prime is 1051231115489. The next prime is 1051231115639. The reversal of 1051231115509 is 9055111321501.
1051231115509 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., 886478740900 + 164752374609 = 941530^2 + 405897^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051231115509 - 231 = 1049083631861 is a prime.
It is a super-2 number, since 2×10512311155092 (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 (1051231155509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525615557754 + 525615557755.
It is an arithmetic number, because the mean of its divisors is an integer number (525615557755).
Almost surely, 21051231115509 is an apocalyptic number.
It is an amenable number.
1051231115509 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051231115509 is an equidigital number, since it uses as much as digits as its factorization.
1051231115509 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6750, while the sum is 34.
The spelling of 1051231115509 in words is "one trillion, fifty-one billion, two hundred thirty-one million, one hundred fifteen thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •