Base | Representation |
---|---|
bin | 10000101010011000001… |
… | …000011100001100101100 |
3 | 11001110110222012010101010 |
4 | 100222120020130030230 |
5 | 122224441443301340 |
6 | 2234002332145220 |
7 | 145503335304246 |
oct | 20523010341454 |
9 | 4043428163333 |
10 | 1145013650220 |
11 | 40166339a710 |
12 | 165ab2908210 |
13 | 83c8878856b |
14 | 3d5c188b096 |
15 | 1ebb76d8b80 |
hex | 10a9821c32c |
1145013650220 has 96 divisors (see below), whose sum is σ = 3546756896256. Its totient is φ = 273669491200.
The previous prime is 1145013650219. The next prime is 1145013650233. The reversal of 1145013650220 is 220563105411.
It is a super-2 number, since 2×11450136502202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12170529 + ... + 12264248.
It is an arithmetic number, because the mean of its divisors is an integer number (36945384336).
Almost surely, 21145013650220 is an apocalyptic number.
1145013650220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1145013650220 is an abundant number, since it is smaller than the sum of its proper divisors (2401743246036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145013650220 is a wasteful number, since it uses less digits than its factorization.
1145013650220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24434871 (or 24434869 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 1145013650220 its reverse (220563105411), we get a palindrome (1365576755631).
The spelling of 1145013650220 in words is "one trillion, one hundred forty-five billion, thirteen million, six hundred fifty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •