Base | Representation |
---|---|
bin | 1111001000001001… |
… | …11001101000000000 |
3 | 202221222221202210100 |
4 | 13210010321220000 |
5 | 113113043112102 |
6 | 3421515002400 |
7 | 405154150434 |
oct | 74404715000 |
9 | 22858852710 |
10 | 8121457152 |
11 | 3498394a66 |
12 | 16a7a39400 |
13 | 9c575a363 |
14 | 5708829c4 |
15 | 327edca1c |
hex | 1e4139a00 |
8121457152 has 120 divisors (see below), whose sum is σ = 23477309856. Its totient is φ = 2702739456.
The previous prime is 8121457139. The next prime is 8121457181. The reversal of 8121457152 is 2517541218.
It is a happy number.
8121457152 is a `hidden beast` number, since 81 + 2 + 1 + 4 + 571 + 5 + 2 = 666.
It is a super-2 number, since 2×81214571522 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 4086303 + ... + 4088289.
Almost surely, 28121457152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 8121457152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11738654928).
8121457152 is an abundant number, since it is smaller than the sum of its proper divisors (15355852704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8121457152 is a wasteful number, since it uses less digits than its factorization.
8121457152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2898 (or 2879 counting only the distinct ones).
The product of its digits is 22400, while the sum is 36.
The square root of 8121457152 is about 90119.1275590260. The cubic root of 8121457152 is about 2010.0706353732.
The spelling of 8121457152 in words is "eight billion, one hundred twenty-one million, four hundred fifty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •