Base | Representation |
---|---|
bin | 1001011101101101111110… |
… | …0000011110110111100011 |
3 | 1100211211010020002210202001 |
4 | 2113123133200132313203 |
5 | 2330443304110000443 |
6 | 34044305120504431 |
7 | 2122551234605434 |
oct | 227333740366743 |
9 | 40754106083661 |
10 | 10406160625123 |
11 | 335225642623a |
12 | 120094a17b117 |
13 | 5a63b1c11773 |
14 | 27d93759348b |
15 | 130a4c601d4d |
hex | 976df81ede3 |
10406160625123 has 4 divisors (see below), whose sum is σ = 10420474464400. Its totient is φ = 10391846785848.
The previous prime is 10406160625121. The next prime is 10406160625129. The reversal of 10406160625123 is 32152606160401.
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 10406160625123 - 21 = 10406160625121 is a prime.
It is a super-2 number, since 2×104061606251232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10406160625121) 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, 7156918548 + ... + 7156920001.
It is an arithmetic number, because the mean of its divisors is an integer number (2605118616100).
Almost surely, 210406160625123 is an apocalyptic number.
10406160625123 is a deficient number, since it is larger than the sum of its proper divisors (14313839277).
10406160625123 is an equidigital number, since it uses as much as digits as its factorization.
10406160625123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14313839276.
The product of its (nonzero) digits is 51840, while the sum is 37.
Adding to 10406160625123 its reverse (32152606160401), we get a palindrome (42558766785524).
The spelling of 10406160625123 in words is "ten trillion, four hundred six billion, one hundred sixty million, six hundred twenty-five thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •