Base | Representation |
---|---|
bin | 10010101100111000… |
… | …11101001111111000 |
3 | 221220201110210011120 |
4 | 21112130131033320 |
5 | 131030300010000 |
6 | 4340141025240 |
7 | 503543406105 |
oct | 112634351770 |
9 | 27821423146 |
10 | 10040235000 |
11 | 42924a6184 |
12 | 1b42555220 |
13 | c40136c73 |
14 | 6b3637aac |
15 | 3db6a96a0 |
hex | 25671d3f8 |
10040235000 has 160 divisors (see below), whose sum is σ = 32448675600. Its totient is φ = 2584960000.
The previous prime is 10040234993. The next prime is 10040235047. The reversal of 10040235000 is 53204001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 423460 + ... + 446540.
Almost surely, 210040235000 is an apocalyptic number.
10040235000 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 10040235000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16224337800).
10040235000 is an abundant number, since it is smaller than the sum of its proper divisors (22408440600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10040235000 is a wasteful number, since it uses less digits than its factorization.
10040235000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23139 (or 23120 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
Adding to 10040235000 its reverse (53204001), we get a palindrome (10093439001).
The spelling of 10040235000 in words is "ten billion, forty million, two hundred thirty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •