Base | Representation |
---|---|
bin | 1100000001001111… |
… | …1011110000111000 |
3 | 22022212010200201012 |
4 | 3000103323300320 |
5 | 23101432413000 |
6 | 1252054013052 |
7 | 142645244453 |
oct | 30023736070 |
9 | 8285120635 |
10 | 3226451000 |
11 | 140627a433 |
12 | 760647188 |
13 | 3c55a0306 |
14 | 22871249a |
15 | 13d3c5735 |
hex | c04fbc38 |
3226451000 has 64 divisors (see below), whose sum is σ = 7558911360. Its totient is φ = 1289040000.
The previous prime is 3226450991. The next prime is 3226451003. The reversal of 3226451000 is 1546223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3226451003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1229690 + ... + 1232310.
It is an arithmetic number, because the mean of its divisors is an integer number (118107990).
Almost surely, 23226451000 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 3226451000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3779455680).
3226451000 is an abundant number, since it is smaller than the sum of its proper divisors (4332460360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3226451000 is a wasteful number, since it uses less digits than its factorization.
3226451000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3873 (or 3859 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 3226451000 is about 56801.8573639982. The cubic root of 3226451000 is about 1477.6617264704.
Adding to 3226451000 its reverse (1546223), we get a palindrome (3227997223).
The spelling of 3226451000 in words is "three billion, two hundred twenty-six million, four hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •