Base | Representation |
---|---|
bin | 11101101010000011011000… |
… | …101011001011110100101000 |
3 | 122002211021220010002021000101 |
4 | 131222003120223023310220 |
5 | 114044004144210403300 |
6 | 1141224104045115144 |
7 | 36321326224264246 |
oct | 3552033053136450 |
9 | 562737803067011 |
10 | 130433202044200 |
11 | 38618457192880 |
12 | 127669b3558ab4 |
13 | 57a1a4b791713 |
14 | 242d001b67796 |
15 | 1012d00c6eb6a |
hex | 76a0d8acbd28 |
130433202044200 has 48 divisors (see below), whose sum is σ = 330826030644960. Its totient is φ = 47430255288000.
The previous prime is 130433202044147. The next prime is 130433202044239. The reversal of 130433202044200 is 2440202334031.
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 11 ways as a sum of consecutive naturals, for example, 29643907356 + ... + 29643911755.
It is an arithmetic number, because the mean of its divisors is an integer number (6892208971770).
Almost surely, 2130433202044200 is an apocalyptic number.
130433202044200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130433202044200 is an abundant number, since it is smaller than the sum of its proper divisors (200392828600760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130433202044200 is a wasteful number, since it uses less digits than its factorization.
130433202044200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59287819138 (or 59287819129 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 130433202044200 its reverse (2440202334031), we get a palindrome (132873404378231).
The spelling of 130433202044200 in words is "one hundred thirty trillion, four hundred thirty-three billion, two hundred two million, forty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •