Base | Representation |
---|---|
bin | 1111100001110… |
… | …10010110001100 |
3 | 100002010000102210 |
4 | 13300322112030 |
5 | 231321344122 |
6 | 20531550420 |
7 | 3141132540 |
oct | 760722614 |
9 | 302100383 |
10 | 130262412 |
11 | 67591095 |
12 | 3775b410 |
13 | 20cab067 |
14 | 1342ba20 |
15 | b68140c |
hex | 7c3a58c |
130262412 has 96 divisors (see below), whose sum is σ = 360138240. Its totient is φ = 35873280.
The previous prime is 130262411. The next prime is 130262471. The reversal of 130262412 is 214262031.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (130262411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 375223 + ... + 375569.
It is an arithmetic number, because the mean of its divisors is an integer number (3751440).
Almost surely, 2130262412 is an apocalyptic number.
130262412 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 130262412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180069120).
130262412 is an abundant number, since it is smaller than the sum of its proper divisors (229875828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130262412 is a wasteful number, since it uses less digits than its factorization.
130262412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 511 (or 509 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 130262412 is about 11413.2559771522. The cubic root of 130262412 is about 506.9203256256.
The spelling of 130262412 in words is "one hundred thirty million, two hundred sixty-two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •