Base | Representation |
---|---|
bin | 1010110111001010001000… |
… | …1111011111101000000000 |
3 | 1120021201021110110012020101 |
4 | 2231302202033133220000 |
5 | 3031132203122203233 |
6 | 41222225341452144 |
7 | 2341556003005060 |
oct | 255624217375000 |
9 | 46251243405211 |
10 | 11942731053568 |
11 | 389497a373807 |
12 | 140a6b8571054 |
13 | 68826b9cc833 |
14 | 2d4061b233a0 |
15 | 15a9d0338c7d |
hex | adca23dfa00 |
11942731053568 has 320 divisors, whose sum is σ = 28731673555200. Its totient is φ = 4851013386240.
The previous prime is 11942731053559. The next prime is 11942731053587. The reversal of 11942731053568 is 86535013724911.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3721634748 + ... + 3721637956.
It is an arithmetic number, because the mean of its divisors is an integer number (89786479860).
It is a 1-persistent number, because it is pandigital, but 2⋅11942731053568 = 23885462107136 is not.
Almost surely, 211942731053568 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 11942731053568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14365836777600).
11942731053568 is an abundant number, since it is smaller than the sum of its proper divisors (16788942501632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11942731053568 is an equidigital number, since it uses as much as digits as its factorization.
11942731053568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3911 (or 3895 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 11942731053568 in words is "eleven trillion, nine hundred forty-two billion, seven hundred thirty-one million, fifty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •