Base | Representation |
---|---|
bin | 1111100100100… |
… | …11001101100101 |
3 | 100002210111202000 |
4 | 13302103031211 |
5 | 231420021110 |
6 | 20543435513 |
7 | 3144210000 |
oct | 762231545 |
9 | 302714660 |
10 | 130626405 |
11 | 6780a608 |
12 | 378b5b99 |
13 | 210a7940 |
14 | 134c4537 |
15 | b7041c0 |
hex | 7c93365 |
130626405 has 160 divisors (see below), whose sum is σ = 301163520. Its totient is φ = 53343360.
The previous prime is 130626403. The next prime is 130626449. The reversal of 130626405 is 504626031.
130626405 is a `hidden beast` number, since 1 + 30 + 626 + 4 + 0 + 5 = 666.
It is not a de Polignac number, because 130626405 - 21 = 130626403 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130626401) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 4213740 + ... + 4213770.
It is an arithmetic number, because the mean of its divisors is an integer number (1882272).
Almost surely, 2130626405 is an apocalyptic number.
130626405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130626405 is an abundant number, since it is smaller than the sum of its proper divisors (170537115).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130626405 is an equidigital number, since it uses as much as digits as its factorization.
130626405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 130626405 is about 11429.1909162460. The cubic root of 130626405 is about 507.3920499687.
The spelling of 130626405 in words is "one hundred thirty million, six hundred twenty-six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •