Base | Representation |
---|---|
bin | 11101101011000011011111… |
… | …010100100100011111110000 |
3 | 122010001212120001201210021021 |
4 | 131223003133110210133300 |
5 | 114101121130424030300 |
6 | 1141315450100105224 |
7 | 36326314015113463 |
oct | 3553033724443760 |
9 | 563055501653237 |
10 | 130502033033200 |
11 | 38644668514654 |
12 | 12778202995214 |
13 | 57a839a974a8a |
14 | 24324913d92da |
15 | 10149cd916d1a |
hex | 76b0df5247f0 |
130502033033200 has 60 divisors (see below), whose sum is σ = 315408566466000. Its totient is φ = 51888233466880.
The previous prime is 130502033033173. The next prime is 130502033033243. The reversal of 130502033033200 is 2330330205031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 976744825 + ... + 976878424.
It is an arithmetic number, because the mean of its divisors is an integer number (5256809441100).
Almost surely, 2130502033033200 is an apocalyptic number.
130502033033200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130502033033200 is an abundant number, since it is smaller than the sum of its proper divisors (184906533432800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130502033033200 is a wasteful number, since it uses less digits than its factorization.
130502033033200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1953623434 (or 1953623423 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 25.
Adding to 130502033033200 its reverse (2330330205031), we get a palindrome (132832363238231).
The spelling of 130502033033200 in words is "one hundred thirty trillion, five hundred two billion, thirty-three million, thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •