Base | Representation |
---|---|
bin | 10011001111110010… |
… | …10001100100010000 |
3 | 222200010100212222210 |
4 | 21213321101210100 |
5 | 132130222031000 |
6 | 4425200032120 |
7 | 514030032156 |
oct | 114771214420 |
9 | 28603325883 |
10 | 10333002000 |
11 | 442278a382 |
12 | 2004602640 |
13 | c889a1789 |
14 | 7004873d6 |
15 | 40723a350 |
hex | 267e51910 |
10333002000 has 160 divisors (see below), whose sum is σ = 33716592000. Its totient is φ = 2722137600.
The previous prime is 10333001989. The next prime is 10333002077. The reversal of 10333002000 is 20033301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 487626 + ... + 508374.
It is an arithmetic number, because the mean of its divisors is an integer number (210728700).
Almost surely, 210333002000 is an apocalyptic number.
10333002000 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 10333002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16858296000).
10333002000 is an abundant number, since it is smaller than the sum of its proper divisors (23383590000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10333002000 is a wasteful number, since it uses less digits than its factorization.
10333002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20858 (or 20842 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 12.
Adding to 10333002000 its reverse (20033301), we get a palindrome (10353035301).
The spelling of 10333002000 in words is "ten billion, three hundred thirty-three million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •