Base | Representation |
---|---|
bin | 1100000001010111… |
… | …0011100111001100 |
3 | 22022220001122002200 |
4 | 3000111303213030 |
5 | 23102044120100 |
6 | 1252112321500 |
7 | 142652360610 |
oct | 30025634714 |
9 | 8286048080 |
10 | 3226941900 |
11 | 1406585236 |
12 | 760843290 |
13 | 3c57128a0 |
14 | 2287dd340 |
15 | 13d470e00 |
hex | c05739cc |
3226941900 has 648 divisors, whose sum is σ = 13177094112. Its totient is φ = 642816000.
The previous prime is 3226941889. The next prime is 3226941943. The reversal of 3226941900 is 91496223.
It is a super-2 number, since 2×32269419002 = 20826308051951220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 78705880 + ... + 78705920.
Almost surely, 23226941900 is an apocalyptic number.
3226941900 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 3226941900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6588547056).
3226941900 is an abundant number, since it is smaller than the sum of its proper divisors (9950152212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3226941900 is a wasteful number, since it uses less digits than its factorization.
3226941900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 36.
The square root of 3226941900 is about 56806.1783611607. The cubic root of 3226941900 is about 1477.7366640572.
The spelling of 3226941900 in words is "three billion, two hundred twenty-six million, nine hundred forty-one thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •