Base | Representation |
---|---|
bin | 11111000010101001001… |
… | …000101001101010000000 |
3 | 21112221000021212112220110 |
4 | 133002221020221222000 |
5 | 234422133144133341 |
6 | 4311541315111320 |
7 | 310054142461434 |
oct | 37025110515200 |
9 | 7487007775813 |
10 | 2133141396096 |
11 | 752729786337 |
12 | 2a55008a2540 |
13 | 1262011c9059 |
14 | 7535d24a9c4 |
15 | 3a74ba15216 |
hex | 1f0a9229a80 |
2133141396096 has 128 divisors (see below), whose sum is σ = 5745482438400. Its totient is φ = 701116416000.
The previous prime is 2133141396079. The next prime is 2133141396107. The reversal of 2133141396096 is 6906931413312.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23039496 + ... + 23131896.
It is an arithmetic number, because the mean of its divisors is an integer number (44886581550).
Almost surely, 22133141396096 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 2133141396096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2872741219200).
2133141396096 is an abundant number, since it is smaller than the sum of its proper divisors (3612341042304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2133141396096 is an equidigital number, since it uses as much as digits as its factorization.
2133141396096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93258 (or 93246 counting only the distinct ones).
The product of its (nonzero) digits is 629856, while the sum is 48.
The spelling of 2133141396096 in words is "two trillion, one hundred thirty-three billion, one hundred forty-one million, three hundred ninety-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •