Base | Representation |
---|---|
bin | 10011000001001011… |
… | …01000011011001000 |
3 | 222100120200200110000 |
4 | 21200211220123020 |
5 | 131402331142412 |
6 | 4405100323000 |
7 | 511011033456 |
oct | 114045503310 |
9 | 28316620400 |
10 | 10210412232 |
11 | 436a569919 |
12 | 1b8b543460 |
13 | c6947bb57 |
14 | 6cc0959d6 |
15 | 3eb5c24dc |
hex | 2609686c8 |
10210412232 has 40 divisors (see below), whose sum is σ = 28598610150. Its totient is φ = 3403470528.
The previous prime is 10210412213. The next prime is 10210412243. The reversal of 10210412232 is 23221401201.
It is a happy number.
10210412232 is a `hidden beast` number, since 1 + 0 + 21 + 0 + 412 + 232 = 666.
It can be written as a sum of positive squares in only one way, i.e., 9507420036 + 702992196 = 97506^2 + 26514^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 7877757 + ... + 7879052.
Almost surely, 210210412232 is an apocalyptic number.
10210412232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10210412232 is an abundant number, since it is smaller than the sum of its proper divisors (18388197918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210412232 is a wasteful number, since it uses less digits than its factorization.
10210412232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15756827 (or 15756814 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 10210412232 its reverse (23221401201), we get a palindrome (33431813433).
The spelling of 10210412232 in words is "ten billion, two hundred ten million, four hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •