Base | Representation |
---|---|
bin | 10101101111001100101100… |
… | …010101111100100000000000 |
3 | 110112111111120002120121001010 |
4 | 111233030230111330200000 |
5 | 100012322224233221000 |
6 | 535155051302440520 |
7 | 26065022054261616 |
oct | 2557145425744000 |
9 | 415444502517033 |
10 | 95602420992000 |
11 | 2850983933334a |
12 | a880481433140 |
13 | 4146367467930 |
14 | 19872790756b6 |
15 | b0bc8973bd50 |
hex | 56f32c57c800 |
95602420992000 has 3072 divisors, whose sum is σ = 378785712614400. Its totient is φ = 21199690137600.
The previous prime is 95602420991989. The next prime is 95602420992073. The reversal of 95602420992000 is 29902420659.
It is a tau number, because it is divible by the number of its divisors (3072).
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 255 ways as a sum of consecutive naturals, for example, 371993855872 + ... + 371993856128.
It is an arithmetic number, because the mean of its divisors is an integer number (123302640825).
Almost surely, 295602420992000 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 95602420992000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189392856307200).
95602420992000 is an abundant number, since it is smaller than the sum of its proper divisors (283183291622400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
95602420992000 is a wasteful number, since it uses less digits than its factorization.
95602420992000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419 (or 389 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 48.
The spelling of 95602420992000 in words is "ninety-five trillion, six hundred two billion, four hundred twenty million, nine hundred ninety-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •