Base | Representation |
---|---|
bin | 10010110111100101… |
… | …11011110011111000 |
3 | 222010222102000000200 |
4 | 21123302323303320 |
5 | 131221240412212 |
6 | 4353105202200 |
7 | 506013456600 |
oct | 113362736370 |
9 | 28128360020 |
10 | 10130013432 |
11 | 4329146030 |
12 | 1b68630360 |
13 | c5590c0b6 |
14 | 6c1527c00 |
15 | 3e44e06dc |
hex | 25bcbbcf8 |
10130013432 has 288 divisors, whose sum is σ = 36020602800. Its totient is φ = 2540160000.
The previous prime is 10130013409. The next prime is 10130013433. The reversal of 10130013432 is 23431003101.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130013433) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1120932 + ... + 1129932.
Almost surely, 210130013432 is an apocalyptic number.
10130013432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10130013432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18010301400).
10130013432 is an abundant number, since it is smaller than the sum of its proper divisors (25890589368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130013432 is a wasteful number, since it uses less digits than its factorization.
10130013432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9067 (or 9053 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10130013432 its reverse (23431003101), we get a palindrome (33561016533).
The spelling of 10130013432 in words is "ten billion, one hundred thirty million, thirteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •