Base | Representation |
---|---|
bin | 10110100011000100… |
… | …01011100100001000 |
3 | 1011020122022122001200 |
4 | 23101202023210020 |
5 | 144242431124000 |
6 | 5321111144200 |
7 | 605660430015 |
oct | 132142134410 |
9 | 34218278050 |
10 | 12105333000 |
11 | 5152165942 |
12 | 241a075060 |
13 | 11abc24847 |
14 | 82b9da70c |
15 | 4acb2a500 |
hex | 2d188b908 |
12105333000 has 96 divisors (see below), whose sum is σ = 40916055960. Its totient is φ = 3228086400.
The previous prime is 12105332989. The next prime is 12105333017. The reversal of 12105333000 is 33350121.
It can be written as a sum of positive squares in 4 ways, for example, as 4545726084 + 7559606916 = 67422^2 + 86946^2 .
It is a super-3 number, since 3×121053330003 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 23 ways as a sum of consecutive naturals, for example, 663519 + ... + 681518.
Almost surely, 212105333000 is an apocalyptic number.
12105333000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12105333000 is an abundant number, since it is smaller than the sum of its proper divisors (28810722960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12105333000 is a wasteful number, since it uses less digits than its factorization.
12105333000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1345064 (or 1345047 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
Adding to 12105333000 its reverse (33350121), we get a palindrome (12138683121).
The spelling of 12105333000 in words is "twelve billion, one hundred five million, three hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •