Base | Representation |
---|---|
bin | 111100101000010011… |
… | …0010001111100000110 |
3 | 110110001221120211210220 |
4 | 1321100212101330012 |
5 | 4113123003343420 |
6 | 135451424125210 |
7 | 12256336126656 |
oct | 1712046217406 |
9 | 413057524726 |
10 | 130201231110 |
11 | 50244223035 |
12 | 21298166806 |
13 | c37c7a02b2 |
14 | 64320cc366 |
15 | 35c0862840 |
hex | 1e50991f06 |
130201231110 has 32 divisors (see below), whose sum is σ = 313060596192. Its totient is φ = 34656145920.
The previous prime is 130201231081. The next prime is 130201231151. The reversal of 130201231110 is 11132102031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 130201231110.
It is a congruent number.
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, 3994899 + ... + 4027358.
It is an arithmetic number, because the mean of its divisors is an integer number (9783143631).
Almost surely, 2130201231110 is an apocalyptic number.
130201231110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130201231110 is an abundant number, since it is smaller than the sum of its proper divisors (182859365082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130201231110 is a wasteful number, since it uses less digits than its factorization.
130201231110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8022808.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 130201231110 its reverse (11132102031), we get a palindrome (141333333141).
The spelling of 130201231110 in words is "one hundred thirty billion, two hundred one million, two hundred thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •