Base | Representation |
---|---|
bin | 1001011110100011001001… |
… | …0001111101101101010101 |
3 | 1100220011221222102001210021 |
4 | 2113220302101331231111 |
5 | 2331212022130330401 |
6 | 34055025325425141 |
7 | 2123565034341220 |
oct | 227506221755525 |
9 | 40804858361707 |
10 | 10420434230101 |
11 | 335831050a995 |
12 | 120367240b1b1 |
13 | 5a784810927c |
14 | 2804cd12c5b7 |
15 | 1310d577d2a1 |
hex | 97a3247db55 |
10420434230101 has 8 divisors (see below), whose sum is σ = 11955406478400. Its totient is φ = 8897046678528.
The previous prime is 10420434230099. The next prime is 10420434230161. The reversal of 10420434230101 is 10103243402401.
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 10420434230101 - 21 = 10420434230099 is a prime.
It is a super-2 number, since 2×104204342301012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10420434230161) 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, 2896172251 + ... + 2896175848.
It is an arithmetic number, because the mean of its divisors is an integer number (1494425809800).
Almost surely, 210420434230101 is an apocalyptic number.
It is an amenable number.
10420434230101 is a deficient number, since it is larger than the sum of its proper divisors (1534972248299).
10420434230101 is an equidigital number, since it uses as much as digits as its factorization.
10420434230101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5792348363.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10420434230101 its reverse (10103243402401), we get a palindrome (20523677632502).
The spelling of 10420434230101 in words is "ten trillion, four hundred twenty billion, four hundred thirty-four million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •