Base | Representation |
---|---|
bin | 111100100011100101… |
… | …1011100101001010010 |
3 | 110102122221020010210201 |
4 | 1321013023130221102 |
5 | 4112312024432010 |
6 | 135424021045414 |
7 | 12252406660042 |
oct | 1710713345122 |
9 | 412587203721 |
10 | 130043202130 |
11 | 50172aa7576 |
12 | 2125325686a |
13 | c355b1ca1a |
14 | 6419113722 |
15 | 35b1a4923a |
hex | 1e472dca52 |
130043202130 has 64 divisors (see below), whose sum is σ = 240778137600. Its totient is φ = 50551983360.
The previous prime is 130043202077. The next prime is 130043202169. The reversal of 130043202130 is 31202340031.
130043202130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1300432021302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130043202098 and 130043202107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18471151 + ... + 18478189.
It is an arithmetic number, because the mean of its divisors is an integer number (3762158400).
Almost surely, 2130043202130 is an apocalyptic number.
130043202130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130043202130 is a deficient number, since it is larger than the sum of its proper divisors (110734935470).
130043202130 is a wasteful number, since it uses less digits than its factorization.
130043202130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7459.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 130043202130 its reverse (31202340031), we get a palindrome (161245542161).
The spelling of 130043202130 in words is "one hundred thirty billion, forty-three million, two hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •