Base | Representation |
---|---|
bin | 111100101001010111… |
… | …1110111110100110100 |
3 | 110110011110110100001110 |
4 | 1321102233313310310 |
5 | 4113211222100040 |
6 | 135455153155020 |
7 | 12260254533102 |
oct | 1712257676464 |
9 | 413143410043 |
10 | 130237300020 |
11 | 50262619153 |
12 | 212a825ba70 |
13 | c3870bb749 |
14 | 6436bdac72 |
15 | 35c3ad9980 |
hex | 1e52bf7d34 |
130237300020 has 48 divisors (see below), whose sum is σ = 377239080960. Its totient is φ = 33532361856.
The previous prime is 130237300009. The next prime is 130237300021. The reversal of 130237300020 is 20003732031.
It is a self number, because there is not a number n which added to its sum of digits gives 130237300020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130237300021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37422772 + ... + 37426251.
It is an arithmetic number, because the mean of its divisors is an integer number (7859147520).
Almost surely, 2130237300020 is an apocalyptic number.
130237300020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130237300020 is an abundant number, since it is smaller than the sum of its proper divisors (247001780940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130237300020 is a wasteful number, since it uses less digits than its factorization.
130237300020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74849064 (or 74849062 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 21.
The spelling of 130237300020 in words is "one hundred thirty billion, two hundred thirty-seven million, three hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •