Base | Representation |
---|---|
bin | 1010010110011001110000… |
… | …0000000000000000000000 |
3 | 1111021220201202121211112020 |
4 | 2211212130000000000000 |
5 | 2442422202304102200 |
6 | 40111520534001440 |
7 | 2253114436456260 |
oct | 245463400000000 |
9 | 44256652554466 |
10 | 11379985612800 |
11 | 3698252225a42 |
12 | 13396261a6280 |
13 | 6471883bb01c |
14 | 2b4b195897a0 |
15 | 14b045e43ea0 |
hex | a599c000000 |
11379985612800 has 1296 divisors, whose sum is σ = 47931834666240. Its totient is φ = 2319282339840.
The previous prime is 11379985612771. The next prime is 11379985612871. The reversal of 11379985612800 is 821658997311.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 598946611191 + ... + 598946611209.
Almost surely, 211379985612800 is an apocalyptic number.
11379985612800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11379985612800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23965917333120).
11379985612800 is an abundant number, since it is smaller than the sum of its proper divisors (36551849053440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11379985612800 is an frugal number, since it uses more digits than its factorization.
11379985612800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108 (or 53 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 60.
The spelling of 11379985612800 in words is "eleven trillion, three hundred seventy-nine billion, nine hundred eighty-five million, six hundred twelve thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •