Base | Representation |
---|---|
bin | 10011011101011010… |
… | …00000101000111010 |
3 | 222222002022010212000 |
4 | 21232231000220322 |
5 | 132343442234300 |
6 | 4444400201430 |
7 | 516614653032 |
oct | 115655005072 |
9 | 28862263760 |
10 | 10447227450 |
11 | 4481207680 |
12 | 2036909276 |
13 | ca65561ba |
14 | 7116dc8c2 |
15 | 41229ec00 |
hex | 26eb40a3a |
10447227450 has 192 divisors, whose sum is σ = 31612083840. Its totient is φ = 2515968000.
The previous prime is 10447227433. The next prime is 10447227457. The reversal of 10447227450 is 5472274401.
It is a super-2 number, since 2×104472274502 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10447227457) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2329210 + ... + 2333690.
It is an arithmetic number, because the mean of its divisors is an integer number (164646270).
Almost surely, 210447227450 is an apocalyptic number.
10447227450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10447227450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15806041920).
10447227450 is an abundant number, since it is smaller than the sum of its proper divisors (21164856390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10447227450 is a wasteful number, since it uses less digits than its factorization.
10447227450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4670 (or 4659 counting only the distinct ones).
The product of its (nonzero) digits is 62720, while the sum is 36.
The spelling of 10447227450 in words is "ten billion, four hundred forty-seven million, two hundred twenty-seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •