Base | Representation |
---|---|
bin | 100010100100110001111100… |
… | …101101101110111111010010 |
3 | 201221101220022112001111020200 |
4 | 202210301330231232333102 |
5 | 124412332130303330224 |
6 | 1255223524525120030 |
7 | 44013024113061321 |
oct | 4244617455567722 |
9 | 657356275044220 |
10 | 152061114511314 |
11 | 444a6835a09a38 |
12 | 1507a5676b9016 |
13 | 66b03bc71c1c8 |
14 | 2979b237980b8 |
15 | 128a6d29105c9 |
hex | 8a4c7cb6efd2 |
152061114511314 has 48 divisors (see below), whose sum is σ = 348867308095488. Its totient is φ = 47702545554816.
The previous prime is 152061114511291. The next prime is 152061114511333. The reversal of 152061114511314 is 413115411160251.
152061114511314 is a `hidden beast` number, since 1 + 5 + 2 + 0 + 61 + 11 + 451 + 131 + 4 = 666.
152061114511314 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10074282 + ... + 20139845.
It is an arithmetic number, because the mean of its divisors is an integer number (7268068918656).
Almost surely, 2152061114511314 is an apocalyptic number.
152061114511314 is an abundant number, since it is smaller than the sum of its proper divisors (196806193584174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152061114511314 is a wasteful number, since it uses less digits than its factorization.
152061114511314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30230599 (or 30230596 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 36.
Adding to 152061114511314 its reverse (413115411160251), we get a palindrome (565176525671565).
The spelling of 152061114511314 in words is "one hundred fifty-two trillion, sixty-one billion, one hundred fourteen million, five hundred eleven thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •