Base | Representation |
---|---|
bin | 111100101011010101… |
… | …1010101110111011010 |
3 | 110110100001111110221000 |
4 | 1321112223111313122 |
5 | 4113330111034320 |
6 | 135505510125430 |
7 | 12262015051131 |
oct | 1712653256732 |
9 | 413301443830 |
10 | 130303221210 |
11 | 50296853778 |
12 | 21306350876 |
13 | c39795c876 |
14 | 644187a918 |
15 | 35c97abc90 |
hex | 1e56ad5dda |
130303221210 has 64 divisors (see below), whose sum is σ = 355556108160. Its totient is φ = 33939440640.
The previous prime is 130303221157. The next prime is 130303221259. The reversal of 130303221210 is 12122303031.
130303221210 is a `hidden beast` number, since 130 + 3 + 0 + 322 + 1 + 210 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 5600071 + ... + 5623290.
It is an arithmetic number, because the mean of its divisors is an integer number (5555564190).
Almost surely, 2130303221210 is an apocalyptic number.
130303221210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130303221210 is an abundant number, since it is smaller than the sum of its proper divisors (225252886950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130303221210 is a wasteful number, since it uses less digits than its factorization.
130303221210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11223420 (or 11223414 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 130303221210 its reverse (12122303031), we get a palindrome (142425524241).
The spelling of 130303221210 in words is "one hundred thirty billion, three hundred three million, two hundred twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •