Base | Representation |
---|---|
bin | 10010101010100110… |
… | …01010100110101011 |
3 | 221212101022200001112 |
4 | 21111103022212223 |
5 | 131010340201443 |
6 | 4334213140535 |
7 | 503221165640 |
oct | 112523124653 |
9 | 27771280045 |
10 | 10021022123 |
11 | 4282673272 |
12 | 1b3802a74b |
13 | c3916abb8 |
14 | 6b0c75dc7 |
15 | 3d9b61b18 |
hex | 2554ca9ab |
10021022123 has 24 divisors (see below), whose sum is σ = 12485541120. Its totient is φ = 7856684640.
The previous prime is 10021022071. The next prime is 10021022129. The reversal of 10021022123 is 32122012001.
It is a happy number.
10021022123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10021022123 - 212 = 10021018027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10021022098 and 10021022107.
It is not an unprimeable number, because it can be changed into a prime (10021022129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67058 + ... + 156648.
It is an arithmetic number, because the mean of its divisors is an integer number (520230880).
Almost surely, 210021022123 is an apocalyptic number.
10021022123 is a deficient number, since it is larger than the sum of its proper divisors (2464518997).
10021022123 is an equidigital number, since it uses as much as digits as its factorization.
10021022123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89675 (or 89646 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10021022123 its reverse (32122012001), we get a palindrome (42143034124).
The spelling of 10021022123 in words is "ten billion, twenty-one million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •