Base | Representation |
---|---|
bin | 1001011110100010010011… |
… | …1011011001010101001011 |
3 | 1100220011101100212200011001 |
4 | 2113220210323121111023 |
5 | 2331211042303210443 |
6 | 34054551204115431 |
7 | 2123556344242600 |
oct | 227504473312513 |
9 | 40804340780131 |
10 | 10420210210123 |
11 | 335820601140a |
12 | 120360b395b77 |
13 | 5a7810891b7c |
14 | 2804ab4966a7 |
15 | 1310c0c7bd4d |
hex | 97a24ed954b |
10420210210123 has 12 divisors (see below), whose sum is σ = 12129274304280. Its totient is φ = 8925857489472.
The previous prime is 10420210210103. The next prime is 10420210210171. The reversal of 10420210210123 is 32101201202401.
It is not a de Polignac number, because 10420210210123 - 29 = 10420210209611 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10420210210123.
It is not an unprimeable number, because it can be changed into a prime (10420210210103) 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 11 ways as a sum of consecutive naturals, for example, 68390533 + ... + 68542726.
It is an arithmetic number, because the mean of its divisors is an integer number (1010772858690).
Almost surely, 210420210210123 is an apocalyptic number.
10420210210123 is a deficient number, since it is larger than the sum of its proper divisors (1709064094157).
10420210210123 is a wasteful number, since it uses less digits than its factorization.
10420210210123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136934826 (or 136934819 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 10420210210123 its reverse (32101201202401), we get a palindrome (42521411412524).
The spelling of 10420210210123 in words is "ten trillion, four hundred twenty billion, two hundred ten million, two hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •