Base | Representation |
---|---|
bin | 110001000011100000001110… |
… | …111101010010100100000000 |
3 | 1001021220000200100112111102020 |
4 | 301003200032331102210000 |
5 | 211234231324312114022 |
6 | 2042503523514521440 |
7 | 63305031262422603 |
oct | 6103401675224400 |
9 | 1037800610474366 |
10 | 215745048160512 |
11 | 62819a63252242 |
12 | 20244a04136280 |
13 | 934c89481c770 |
14 | 3b3c18a60833a |
15 | 19e205555e35c |
hex | c4380ef52900 |
215745048160512 has 288 divisors, whose sum is σ = 639776313657600. Its totient is φ = 64085207187456.
The previous prime is 215745048160463. The next prime is 215745048160513. The reversal of 215745048160512 is 215061840547512.
It is a super-2 number, since 2×2157450481605122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (215745048160513) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2281206858 + ... + 2281301430.
Almost surely, 2215745048160512 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 215745048160512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (319888156828800).
215745048160512 is an abundant number, since it is smaller than the sum of its proper divisors (424031265497088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215745048160512 is a wasteful number, since it uses less digits than its factorization.
215745048160512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102513 (or 102499 counting only the distinct ones).
The product of its (nonzero) digits is 2688000, while the sum is 51.
The spelling of 215745048160512 in words is "two hundred fifteen trillion, seven hundred forty-five billion, forty-eight million, one hundred sixty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •