Base | Representation |
---|---|
bin | 111100101001001010… |
… | …0001001011101001010 |
3 | 110110010221210002111000 |
4 | 1321102110021131022 |
5 | 4113202342012302 |
6 | 135454333315430 |
7 | 12260136003114 |
oct | 1712224113512 |
9 | 413127702430 |
10 | 130230032202 |
11 | 50259504796 |
12 | 212a5935b76 |
13 | c38574566a |
14 | 6435c683b4 |
15 | 35c315131c |
hex | 1e5250974a |
130230032202 has 32 divisors (see below), whose sum is σ = 289548792000. Its totient is φ = 43387702704.
The previous prime is 130230032197. The next prime is 130230032281. The reversal of 130230032202 is 202230032031.
It is a happy number.
130230032202 is a `hidden beast` number, since 130 + 2 + 300 + 32 + 202 = 666.
It is a super-2 number, since 2×1302300322022 (a number of 23 digits) contains 22 as substring.
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 (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 513448 + ... + 723939.
It is an arithmetic number, because the mean of its divisors is an integer number (9048399750).
Almost surely, 2130230032202 is an apocalyptic number.
130230032202 is an abundant number, since it is smaller than the sum of its proper divisors (159318759798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130230032202 is a wasteful number, since it uses less digits than its factorization.
130230032202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1239347 (or 1239341 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 130230032202 its reverse (202230032031), we get a palindrome (332460064233).
The spelling of 130230032202 in words is "one hundred thirty billion, two hundred thirty million, thirty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •