Base | Representation |
---|---|
bin | 10010110101101110… |
… | …11010111011001000 |
3 | 222002220001101012110 |
4 | 21122313122323020 |
5 | 131203242142412 |
6 | 4351350542320 |
7 | 505434041211 |
oct | 113267327310 |
9 | 28086041173 |
10 | 10114412232 |
11 | 432035a681 |
12 | 1b633679a0 |
13 | c52608c12 |
14 | 6bd426408 |
15 | 3e2e5cd3c |
hex | 25addaec8 |
10114412232 has 32 divisors (see below), whose sum is σ = 25296972480. Its totient is φ = 3370011840.
The previous prime is 10114412159. The next prime is 10114412239. The reversal of 10114412232 is 23221441101.
It is a junction number, because it is equal to n+sod(n) for n = 10114412199 and 10114412208.
It is not an unprimeable number, because it can be changed into a prime (10114412239) 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 7 ways as a sum of consecutive naturals, for example, 33828 + ... + 146195.
It is an arithmetic number, because the mean of its divisors is an integer number (790530390).
Almost surely, 210114412232 is an apocalyptic number.
10114412232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10114412232 is an abundant number, since it is smaller than the sum of its proper divisors (15182560248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10114412232 is a wasteful number, since it uses less digits than its factorization.
10114412232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182373 (or 182369 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 10114412232 its reverse (23221441101), we get a palindrome (33335853333).
The spelling of 10114412232 in words is "ten billion, one hundred fourteen million, four hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •