Base | Representation |
---|---|
bin | 1001000111111000110011… |
… | …0100001000001010010000 |
3 | 1022111222001101021110101022 |
4 | 2101332030310020022100 |
5 | 2303322203421030222 |
6 | 33200121232055012 |
7 | 2053503166414604 |
oct | 221761464101220 |
9 | 38458041243338 |
10 | 10031111111312 |
11 | 3218196791465 |
12 | 116011a994468 |
13 | 579c11791925 |
14 | 269718d69504 |
15 | 125deb39a042 |
hex | 91f8cd08290 |
10031111111312 has 10 divisors (see below), whose sum is σ = 19435277778198. Its totient is φ = 5015555555648.
The previous prime is 10031111111311. The next prime is 10031111111339. The reversal of 10031111111312 is 21311111113001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 7261429647616 + 2769681463696 = 2694704^2 + 1664236^2 .
It is a super-2 number, since 2×100311111113122 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10031111111311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 313472222213 + ... + 313472222244.
Almost surely, 210031111111312 is an apocalyptic number.
It is an amenable number.
10031111111312 is a deficient number, since it is larger than the sum of its proper divisors (9404166666886).
10031111111312 is an equidigital number, since it uses as much as digits as its factorization.
10031111111312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626944444465 (or 626944444459 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 10031111111312 its reverse (21311111113001), we get a palindrome (31342222224313).
The spelling of 10031111111312 in words is "ten trillion, thirty-one billion, one hundred eleven million, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •