Base | Representation |
---|---|
bin | 10011011011110110… |
… | …10100001000111011 |
3 | 222221011210021201102 |
4 | 21231323110020323 |
5 | 132332123400443 |
6 | 4443213042015 |
7 | 516366144344 |
oct | 115573241073 |
9 | 28834707642 |
10 | 10434200123 |
11 | 4474919a96 |
12 | 203248630b |
13 | ca3944719 |
14 | 70daab0cb |
15 | 411079cb8 |
hex | 26ded423b |
10434200123 has 4 divisors (see below), whose sum is σ = 10531716120. Its totient is φ = 10336684128.
The previous prime is 10434200107. The next prime is 10434200129. The reversal of 10434200123 is 32100243401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32100243401 = 3313 ⋅9689177.
It is a cyclic number.
It is not a de Polignac number, because 10434200123 - 24 = 10434200107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10434200095 and 10434200104.
It is not an unprimeable number, because it can be changed into a prime (10434200129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48757838 + ... + 48758051.
It is an arithmetic number, because the mean of its divisors is an integer number (2632929030).
Almost surely, 210434200123 is an apocalyptic number.
10434200123 is a deficient number, since it is larger than the sum of its proper divisors (97515997).
10434200123 is an equidigital number, since it uses as much as digits as its factorization.
10434200123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97515996.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10434200123 its reverse (32100243401), we get a palindrome (42534443524).
The spelling of 10434200123 in words is "ten billion, four hundred thirty-four million, two hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •