Base | Representation |
---|---|
bin | 10010101101000111… |
… | …01000000001001110 |
3 | 221220212000020211211 |
4 | 21112203220001032 |
5 | 131031240123001 |
6 | 4340245205034 |
7 | 503565363442 |
oct | 112643500116 |
9 | 27825006754 |
10 | 10042114126 |
11 | 4293569a80 |
12 | 1b4310077a |
13 | c40644385 |
14 | 6b39a6822 |
15 | 3db92b351 |
hex | 2568e804e |
10042114126 has 8 divisors (see below), whose sum is σ = 16432550424. Its totient is φ = 4564597320.
The previous prime is 10042114123. The next prime is 10042114139. The reversal of 10042114126 is 62141124001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×100421141262 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 456459733 = 10042114126 / (1 + 0 + 0 + 4 + 2 + 1 + 1 + 4 + 1 + 2 + 6).
It is a junction number, because it is equal to n+sod(n) for n = 10042114097 and 10042114106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10042114123) 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, 228229845 + ... + 228229888.
It is an arithmetic number, because the mean of its divisors is an integer number (2054068803).
Almost surely, 210042114126 is an apocalyptic number.
10042114126 is a deficient number, since it is larger than the sum of its proper divisors (6390436298).
10042114126 is a wasteful number, since it uses less digits than its factorization.
10042114126 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456459746.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 10042114126 its reverse (62141124001), we get a palindrome (72183238127).
The spelling of 10042114126 in words is "ten billion, forty-two million, one hundred fourteen thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •