Base | Representation |
---|---|
bin | 10110110010000010… |
… | …10110110011010000 |
3 | 1011120101200102201000 |
4 | 23121001112303100 |
5 | 200022110233000 |
6 | 5341355342000 |
7 | 612044216460 |
oct | 133101266320 |
9 | 34511612630 |
10 | 12230946000 |
11 | 5207060839 |
12 | 2454151900 |
13 | 11cbc65570 |
14 | 840577ba0 |
15 | 4b8b8e000 |
hex | 2d9056cd0 |
12230946000 has 1280 divisors, whose sum is σ = 57196339200. Its totient is φ = 2426112000.
The previous prime is 12230945941. The next prime is 12230946029. The reversal of 12230946000 is 64903221.
12230946000 is a `hidden beast` number, since 1 + 22 + 30 + 9 + 4 + 600 + 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 255 ways as a sum of consecutive naturals, for example, 93365935 + ... + 93366065.
It is an arithmetic number, because the mean of its divisors is an integer number (44684640).
Almost surely, 212230946000 is an apocalyptic number.
12230946000 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 12230946000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28598169600).
12230946000 is an abundant number, since it is smaller than the sum of its proper divisors (44965393200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12230946000 is a wasteful number, since it uses less digits than its factorization.
12230946000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202 (or 180 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 12230946000 in words is "twelve billion, two hundred thirty million, nine hundred forty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •