Base | Representation |
---|---|
bin | 10011000100000000… |
… | …00111011010011011 |
3 | 222102020022210000111 |
4 | 21202000013122123 |
5 | 131424414211443 |
6 | 4411304545151 |
7 | 511416454615 |
oct | 114200073233 |
9 | 28366283014 |
10 | 10234132123 |
11 | 438199aa36 |
12 | 1b974821b7 |
13 | c713654a7 |
14 | 6d12abdb5 |
15 | 3ed70a69d |
hex | 26200769b |
10234132123 has 4 divisors (see below), whose sum is σ = 10242147600. Its totient is φ = 10226116648.
The previous prime is 10234132121. The next prime is 10234132193. The reversal of 10234132123 is 32123143201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32123143201 = 331 ⋅97048771.
It is a cyclic number.
It is not a de Polignac number, because 10234132123 - 21 = 10234132121 is a prime.
It is a super-2 number, since 2×102341321232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10234132094 and 10234132103.
It is not an unprimeable number, because it can be changed into a prime (10234132121) 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, 4005823 + ... + 4008376.
It is an arithmetic number, because the mean of its divisors is an integer number (2560536900).
Almost surely, 210234132123 is an apocalyptic number.
10234132123 is a deficient number, since it is larger than the sum of its proper divisors (8015477).
10234132123 is an equidigital number, since it uses as much as digits as its factorization.
10234132123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8015476.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10234132123 its reverse (32123143201), we get a palindrome (42357275324).
The spelling of 10234132123 in words is "ten billion, two hundred thirty-four million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •