Base | Representation |
---|---|
bin | 101100001000001010110… |
… | …010111000110011011000 |
3 | 101201220020010022112020000 |
4 | 230020022302320303120 |
5 | 344140403033214000 |
6 | 10241024520333000 |
7 | 432041251622145 |
oct | 54101262706330 |
9 | 11656203275200 |
10 | 3032428023000 |
11 | a6a055622392 |
12 | 40b856014160 |
13 | 18cc58c42aac |
14 | a6aad9b73cc |
15 | 53d315cc000 |
hex | 2c20acb8cd8 |
3032428023000 has 640 divisors, whose sum is σ = 11260577465280. Its totient is φ = 758569881600.
The previous prime is 3032428022933. The next prime is 3032428023011. The reversal of 3032428023000 is 3208242303.
3032428023000 is a `hidden beast` number, since 3 + 0 + 3 + 2 + 428 + 0 + 230 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 436505527 + ... + 436512473.
Almost surely, 23032428023000 is an apocalyptic number.
3032428023000 is a gapful number since it is divisible by the number (30) 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 3032428023000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5630288732640).
3032428023000 is an abundant number, since it is smaller than the sum of its proper divisors (8228149442280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3032428023000 is a wasteful number, since it uses less digits than its factorization.
3032428023000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7314 (or 7291 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
The spelling of 3032428023000 in words is "three trillion, thirty-two billion, four hundred twenty-eight million, twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •