Base | Representation |
---|---|
bin | 10110010111100011010… |
… | …001011100000011101000 |
3 | 12102221120021112202111220 |
4 | 112113203101130003220 |
5 | 200141003234332242 |
6 | 3134050321222040 |
7 | 216024114114630 |
oct | 26274321340350 |
9 | 5387507482456 |
10 | 1537116324072 |
11 | 542984101a8a |
12 | 209aa1191920 |
13 | b1c45c22344 |
14 | 5457ac716c0 |
15 | 29eb5b18bec |
hex | 165e345c0e8 |
1537116324072 has 64 divisors (see below), whose sum is σ = 4444673748480. Its totient is φ = 433884810432.
The previous prime is 1537116324053. The next prime is 1537116324103. The reversal of 1537116324072 is 2704236117351.
It is a super-2 number, since 2×15371163240722 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55103538 + ... + 55131425.
It is an arithmetic number, because the mean of its divisors is an integer number (69448027320).
Almost surely, 21537116324072 is an apocalyptic number.
1537116324072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1537116324072 is an abundant number, since it is smaller than the sum of its proper divisors (2907557424408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1537116324072 is a wasteful number, since it uses less digits than its factorization.
1537116324072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110235062 (or 110235058 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 42.
The spelling of 1537116324072 in words is "one trillion, five hundred thirty-seven billion, one hundred sixteen million, three hundred twenty-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.027 sec. • engine limits •