Base | Representation |
---|---|
bin | 1001001001101000101100… |
… | …0101110001011110000111 |
3 | 1022121211120122000100010211 |
4 | 2102122023011301132013 |
5 | 2304320212110003412 |
6 | 33222005504300251 |
7 | 2055615413024131 |
oct | 222321305613607 |
9 | 38554518010124 |
10 | 10061146953607 |
11 | 32299aa186322 |
12 | 1165b01911687 |
13 | 57c9ba3c5c89 |
14 | 26ad68064051 |
15 | 126aa8203ca7 |
hex | 9268b171787 |
10061146953607 has 4 divisors (see below), whose sum is σ = 10061153892000. Its totient is φ = 10061140015216.
The previous prime is 10061146953601. The next prime is 10061146953691. The reversal of 10061146953607 is 70635964116001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10061146953607 - 219 = 10061146429319 is a prime.
It is a super-2 number, since 2×100611469536072 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10061146953601) 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, 372982 + ... + 4501267.
It is an arithmetic number, because the mean of its divisors is an integer number (2515288473000).
Almost surely, 210061146953607 is an apocalyptic number.
10061146953607 is a deficient number, since it is larger than the sum of its proper divisors (6938393).
10061146953607 is an equidigital number, since it uses as much as digits as its factorization.
10061146953607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6938392.
The product of its (nonzero) digits is 816480, while the sum is 49.
The spelling of 10061146953607 in words is "ten trillion, sixty-one billion, one hundred forty-six million, nine hundred fifty-three thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •