Base | Representation |
---|---|
bin | 1010100101000010111000… |
… | …0110111110001000000000 |
3 | 1112011222001101000121211101 |
4 | 2221100232012332020000 |
5 | 3011032401011014312 |
6 | 40423242533024144 |
7 | 2310231346226416 |
oct | 251205606761000 |
9 | 45158041017741 |
10 | 11631545016832 |
11 | 3784a01a23554 |
12 | 137a330a85054 |
13 | 664b0856aaa0 |
14 | 2c2d811252b6 |
15 | 15286aadda57 |
hex | a942e1be200 |
11631545016832 has 160 divisors (see below), whose sum is σ = 25728682883904. Its totient is φ = 5218405171200.
The previous prime is 11631545016809. The next prime is 11631545016859. The reversal of 11631545016832 is 23861054513611.
It is a hoax number, since the sum of its digits (46) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 268661107 + ... + 268704397.
Almost surely, 211631545016832 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 11631545016832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12864341441952).
11631545016832 is an abundant number, since it is smaller than the sum of its proper divisors (14097137867072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11631545016832 is a wasteful number, since it uses less digits than its factorization.
11631545016832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44450 (or 44434 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 46.
The spelling of 11631545016832 in words is "eleven trillion, six hundred thirty-one billion, five hundred forty-five million, sixteen thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •