Base | Representation |
---|---|
bin | 1001001101101010111010… |
… | …0110001101011101000110 |
3 | 1022212110111022202110001022 |
4 | 2103122232212031131012 |
5 | 2311434141301324014 |
6 | 33313511533231142 |
7 | 2063621203245314 |
oct | 223325646153506 |
9 | 38773438673038 |
10 | 10130462136134 |
11 | 325633985893a |
12 | 11774273324b2 |
13 | 5863b59b8992 |
14 | 270461b350b4 |
15 | 1287b3640a8e |
hex | 936ae98d746 |
10130462136134 has 8 divisors (see below), whose sum is σ = 15297677722800. Its totient is φ = 5031236228536.
The previous prime is 10130462136131. The next prime is 10130462136149. The reversal of 10130462136134 is 43163126403101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10130462136094 and 10130462136103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130462136131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16997419394 + ... + 16997419989.
It is an arithmetic number, because the mean of its divisors is an integer number (1912209715350).
Almost surely, 210130462136134 is an apocalyptic number.
10130462136134 is a deficient number, since it is larger than the sum of its proper divisors (5167215586666).
10130462136134 is a wasteful number, since it uses less digits than its factorization.
10130462136134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33994839534.
The product of its (nonzero) digits is 31104, while the sum is 35.
Adding to 10130462136134 its reverse (43163126403101), we get a palindrome (53293588539235).
The spelling of 10130462136134 in words is "ten trillion, one hundred thirty billion, four hundred sixty-two million, one hundred thirty-six thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •