Base | Representation |
---|---|
bin | 11101100110101010100101… |
… | …110010101100010011000000 |
3 | 122002000001001010212022022021 |
4 | 131212222211302230103000 |
5 | 114031200430023441344 |
6 | 1140525125225051224 |
7 | 36265445533612210 |
oct | 3546524562542300 |
9 | 562001033768267 |
10 | 130200420140224 |
11 | 3853876293aa55 |
12 | 12729869326b14 |
13 | 5785b01947b35 |
14 | 2421a3bda8240 |
15 | 100bc2985db84 |
hex | 766aa5cac4c0 |
130200420140224 has 28 divisors (see below), whose sum is σ = 295275952819024. Its totient is φ = 55800180059904.
The previous prime is 130200420140207. The next prime is 130200420140279. The reversal of 130200420140224 is 422041024002031.
It is a tau number, because it is divible by the number of its divisors (28).
It is a super-3 number, since 3×1302004201402243 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145312968459 + ... + 145312969354.
Almost surely, 2130200420140224 is an apocalyptic number.
130200420140224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
130200420140224 is an abundant number, since it is smaller than the sum of its proper divisors (165075532678800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130200420140224 is an equidigital number, since it uses as much as digits as its factorization.
130200420140224 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290625937832 (or 290625937822 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 130200420140224 its reverse (422041024002031), we get a palindrome (552241444142255).
The spelling of 130200420140224 in words is "one hundred thirty trillion, two hundred billion, four hundred twenty million, one hundred forty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •