Base | Representation |
---|---|
bin | 1001001101111001001101… |
… | …1110100110110101100011 |
3 | 1022212211101221101010001101 |
4 | 2103132103132212311203 |
5 | 2312020022321003121 |
6 | 33315344545415231 |
7 | 2064115311516322 |
oct | 223362336466543 |
9 | 38784357333041 |
10 | 10134302125411 |
11 | 3257a2a3926a2 |
12 | 117811933a517 |
13 | 586878414a99 |
14 | 270707b160b9 |
15 | 12893a80a491 |
hex | 937937a6d63 |
10134302125411 has 8 divisors (see below), whose sum is σ = 10372207662080. Its totient is φ = 9896497683912.
The previous prime is 10134302125399. The next prime is 10134302125417. The reversal of 10134302125411 is 11452120343101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10134302125411 - 223 = 10134293736803 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10134302125411.
It is not an unprimeable number, because it can be changed into a prime (10134302125417) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25070931 + ... + 25471948.
It is an arithmetic number, because the mean of its divisors is an integer number (1296525957760).
Almost surely, 210134302125411 is an apocalyptic number.
10134302125411 is a deficient number, since it is larger than the sum of its proper divisors (237905536669).
10134302125411 is an equidigital number, since it uses as much as digits as its factorization.
10134302125411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50547585.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 10134302125411 its reverse (11452120343101), we get a palindrome (21586422468512).
The spelling of 10134302125411 in words is "ten trillion, one hundred thirty-four billion, three hundred two million, one hundred twenty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •