Base | Representation |
---|---|
bin | 101110111001111011110… |
… | …001010100110110000000 |
3 | 102102010220110101012122120 |
4 | 232321323301110312000 |
5 | 410302310303000000 |
6 | 10504433044204240 |
7 | 451606266640125 |
oct | 56717361246600 |
9 | 12363813335576 |
10 | 3223302000000 |
11 | 1032aa3a47415 |
12 | 440845399680 |
13 | 1a4c57659454 |
14 | b2019a3a74c |
15 | 58ca377e6a0 |
hex | 2ee7bc54d80 |
3223302000000 has 448 divisors, whose sum is σ = 11332134634320. Its totient is φ = 808960000000.
The previous prime is 3223301999987. The next prime is 3223302000019. The reversal of 3223302000000 is 2033223.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 101984200 + ... + 102015800.
Almost surely, 23223302000000 is an apocalyptic number.
3223302000000 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 3223302000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5666067317160).
3223302000000 is an abundant number, since it is smaller than the sum of its proper divisors (8108832634320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3223302000000 is an frugal number, since it uses more digits than its factorization.
3223302000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31665 (or 31628 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 15.
Adding to 3223302000000 its reverse (2033223), we get a palindrome (3223304033223).
The spelling of 3223302000000 in words is "three trillion, two hundred twenty-three billion, three hundred two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •