Base | Representation |
---|---|
bin | 1001100110001010101111… |
… | …0100100110110000001011 |
3 | 1101100200210210112122121101 |
4 | 2121202223310212300023 |
5 | 2340333102011420011 |
6 | 34235113252522231 |
7 | 2136210414241651 |
oct | 231425364466013 |
9 | 41320723478541 |
10 | 10551322373131 |
11 | 33a8877453021 |
12 | 1224b00620377 |
13 | 5b6ca6cb5607 |
14 | 286988548dd1 |
15 | 1346e657a2c1 |
hex | 998abd26c0b |
10551322373131 has 2 divisors, whose sum is σ = 10551322373132. Its totient is φ = 10551322373130.
The previous prime is 10551322373069. The next prime is 10551322373143. The reversal of 10551322373131 is 13137322315501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10551322373131 - 219 = 10551321848843 is a prime.
It is a super-2 number, since 2×105513223731312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10551322373191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5275661186565 + 5275661186566.
It is an arithmetic number, because the mean of its divisors is an integer number (5275661186566).
Almost surely, 210551322373131 is an apocalyptic number.
10551322373131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10551322373131 is an equidigital number, since it uses as much as digits as its factorization.
10551322373131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 37.
Adding to 10551322373131 its reverse (13137322315501), we get a palindrome (23688644688632).
The spelling of 10551322373131 in words is "ten trillion, five hundred fifty-one billion, three hundred twenty-two million, three hundred seventy-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •