Base | Representation |
---|---|
bin | 10011001111100110… |
… | …01011000000000000 |
3 | 222200000100121112102 |
4 | 21213303023000000 |
5 | 132124314332430 |
6 | 4425101445532 |
7 | 514010320145 |
oct | 114763130000 |
9 | 28600317472 |
10 | 10331402240 |
11 | 4421897465 |
12 | 2003b708a8 |
13 | c88561583 |
14 | 70018c3cc |
15 | 407021345 |
hex | 267ccb000 |
10331402240 has 104 divisors (see below), whose sum is σ = 25593664128. Its totient is φ = 3999006720.
The previous prime is 10331402233. The next prime is 10331402303. The reversal of 10331402240 is 4220413301.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 626744 + ... + 643016.
Almost surely, 210331402240 is an apocalyptic number.
10331402240 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 10331402240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12796832064).
10331402240 is an abundant number, since it is smaller than the sum of its proper divisors (15262261888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10331402240 is an equidigital number, since it uses as much as digits as its factorization.
10331402240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16333 (or 16311 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10331402240 its reverse (4220413301), we get a palindrome (14551815541).
The spelling of 10331402240 in words is "ten billion, three hundred thirty-one million, four hundred two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •