Base | Representation |
---|---|
bin | 10000001110100001101… |
… | …111011100110010111000 |
3 | 10221121021221101101102201 |
4 | 100032201233130302320 |
5 | 121232221141201102 |
6 | 2212135143235544 |
7 | 143364316313446 |
oct | 20164157346270 |
9 | 3847257341381 |
10 | 1115110100152 |
11 | 39aa08642974 |
12 | 160148148bb4 |
13 | 81201393139 |
14 | 3bd8618bb96 |
15 | 1e0172b2987 |
hex | 103a1bdccb8 |
1115110100152 has 64 divisors (see below), whose sum is σ = 2145504348000. Its totient is φ = 543176054784.
The previous prime is 1115110100129. The next prime is 1115110100191. The reversal of 1115110100152 is 2510010115111.
It is a super-2 number, since 2×11151101001522 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52641099 + ... + 52662277.
Almost surely, 21115110100152 is an apocalyptic number.
It is an amenable number.
1115110100152 is a deficient number, since it is larger than the sum of its proper divisors (1030394247848).
1115110100152 is a wasteful number, since it uses less digits than its factorization.
1115110100152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22360 (or 22356 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 19.
Adding to 1115110100152 its reverse (2510010115111), we get a palindrome (3625120215263).
The spelling of 1115110100152 in words is "one trillion, one hundred fifteen billion, one hundred ten million, one hundred thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •