Base | Representation |
---|---|
bin | 1001001101111010011000… |
… | …0101100100110010000101 |
3 | 1022212212012200211202220212 |
4 | 2103132212011210302011 |
5 | 2312021142232034001 |
6 | 33315435541205205 |
7 | 2064126122311253 |
oct | 223364605446205 |
9 | 38785180752825 |
10 | 10134614330501 |
11 | 325807a642a31 |
12 | 11781a5a00805 |
13 | 5868c7cc701b |
14 | 2707373855d3 |
15 | 128957e2a7bb |
hex | 937a6164c85 |
10134614330501 has 2 divisors, whose sum is σ = 10134614330502. Its totient is φ = 10134614330500.
The previous prime is 10134614330497. The next prime is 10134614330527. The reversal of 10134614330501 is 10503341643101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7090897939876 + 3043716390625 = 2662874^2 + 1744625^2 .
It is a cyclic number.
It is not a de Polignac number, because 10134614330501 - 22 = 10134614330497 is a prime.
It is a super-2 number, since 2×101346143305012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10134614338501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5067307165250 + 5067307165251.
It is an arithmetic number, because the mean of its divisors is an integer number (5067307165251).
Almost surely, 210134614330501 is an apocalyptic number.
It is an amenable number.
10134614330501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10134614330501 is an equidigital number, since it uses as much as digits as its factorization.
10134614330501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 10134614330501 its reverse (10503341643101), we get a palindrome (20637955973602).
The spelling of 10134614330501 in words is "ten trillion, one hundred thirty-four billion, six hundred fourteen million, three hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •