Base | Representation |
---|---|
bin | 1001001101111000111010… |
… | …1010100001101100111111 |
3 | 1022212211012022102000021011 |
4 | 2103132032222201230333 |
5 | 2312014341132122111 |
6 | 33315332542420051 |
7 | 2064113311202362 |
oct | 223361652415477 |
9 | 38784168360234 |
10 | 10134221364031 |
11 | 3257998841456 |
12 | 11780b6291627 |
13 | 586864778c9b |
14 | 2706db0d20d9 |
15 | 1289336a6021 |
hex | 9378eaa1b3f |
10134221364031 has 4 divisors (see below), whose sum is σ = 10262502647200. Its totient is φ = 10005940080864.
The previous prime is 10134221363977. The next prime is 10134221364107. The reversal of 10134221364031 is 13046312243101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10134221364031 - 241 = 7935198108479 is a prime.
It is a super-2 number, since 2×101342213640312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10134221363984 and 10134221364002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10134221364131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64140641466 + ... + 64140641623.
It is an arithmetic number, because the mean of its divisors is an integer number (2565625661800).
Almost surely, 210134221364031 is an apocalyptic number.
10134221364031 is a deficient number, since it is larger than the sum of its proper divisors (128281283169).
10134221364031 is an equidigital number, since it uses as much as digits as its factorization.
10134221364031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128281283168.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 10134221364031 in words is "ten trillion, one hundred thirty-four billion, two hundred twenty-one million, three hundred sixty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •