Base | Representation |
---|---|
bin | 10011000011111000… |
… | …10000010100000000 |
3 | 222102011102100122110 |
4 | 21201330100110000 |
5 | 131424134320000 |
6 | 4411231135320 |
7 | 511405041045 |
oct | 114174202400 |
9 | 28364370573 |
10 | 10233120000 |
11 | 4381369574 |
12 | 1b97074540 |
13 | c7109c8bc |
14 | 6d10c71cc |
15 | 3ed5aa850 |
hex | 261f10500 |
10233120000 has 180 divisors, whose sum is σ = 34034480480. Its totient is φ = 2728704000.
The previous prime is 10233119993. The next prime is 10233120017. The reversal of 10233120000 is 2133201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 469341 + ... + 490659.
Almost surely, 210233120000 is an apocalyptic number.
10233120000 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 10233120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17017240240).
10233120000 is an abundant number, since it is smaller than the sum of its proper divisors (23801360480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10233120000 is an frugal number, since it uses more digits than its factorization.
10233120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21358 (or 21329 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 10233120000 its reverse (2133201), we get a palindrome (10235253201).
The spelling of 10233120000 in words is "ten billion, two hundred thirty-three million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •