Base | Representation |
---|---|
bin | 1001001110100010100100… |
… | …1001100000001010001111 |
3 | 1022220220001120211120010220 |
4 | 2103220221021200022033 |
5 | 2312210241144010111 |
6 | 33324422302202423 |
7 | 2064660355365060 |
oct | 223505111401217 |
9 | 38826046746126 |
10 | 10145403110031 |
11 | 3261706624752 |
12 | 117a2b6b83413 |
13 | 587927239137 |
14 | 27107c192567 |
15 | 128d8a195e06 |
hex | 93a2926028f |
10145403110031 has 16 divisors (see below), whose sum is σ = 15713098963968. Its totient is φ = 5702334300000.
The previous prime is 10145403110021. The next prime is 10145403110111. The reversal of 10145403110031 is 13001130454101.
It is not a de Polignac number, because 10145403110031 - 227 = 10145268892303 is a prime.
It is a super-2 number, since 2×101454031100312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10145403109983 and 10145403110010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145403110021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3959953095 + ... + 3959955656.
It is an arithmetic number, because the mean of its divisors is an integer number (982068685248).
Almost surely, 210145403110031 is an apocalyptic number.
10145403110031 is a deficient number, since it is larger than the sum of its proper divisors (5567695853937).
10145403110031 is an equidigital number, since it uses as much as digits as its factorization.
10145403110031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7919908822.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 10145403110031 its reverse (13001130454101), we get a palindrome (23146533564132).
The spelling of 10145403110031 in words is "ten trillion, one hundred forty-five billion, four hundred three million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •