Base | Representation |
---|---|
bin | 10011001101001010… |
… | …11110000010101000 |
3 | 222121121000202012010 |
4 | 21212211132002220 |
5 | 132104111024000 |
6 | 4423053115520 |
7 | 513342222462 |
oct | 114645360250 |
9 | 28547022163 |
10 | 10311033000 |
11 | 4411344784 |
12 | 1bb9188ba0 |
13 | c8427c078 |
14 | 6db5a9132 |
15 | 40534ad50 |
hex | 26695e0a8 |
10311033000 has 128 divisors (see below), whose sum is σ = 32224533120. Its totient is φ = 2744985600.
The previous prime is 10311032999. The next prime is 10311033011. The reversal of 10311033000 is 33011301.
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, 2016447 + ... + 2021553.
It is an arithmetic number, because the mean of its divisors is an integer number (251754165).
Almost surely, 210311033000 is an apocalyptic number.
10311033000 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 10311033000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16112266560).
10311033000 is an abundant number, since it is smaller than the sum of its proper divisors (21913500120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311033000 is a wasteful number, since it uses less digits than its factorization.
10311033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5804 (or 5790 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 12.
Adding to 10311033000 its reverse (33011301), we get a palindrome (10344044301).
The spelling of 10311033000 in words is "ten billion, three hundred eleven million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •