Base | Representation |
---|---|
bin | 1110101111001… |
… | …00111010010100 |
3 | 22121121121011000 |
4 | 13113210322110 |
5 | 223121333022 |
6 | 20133343300 |
7 | 3030522054 |
oct | 727447224 |
9 | 277547130 |
10 | 123621012 |
11 | 63865329 |
12 | 35497b30 |
13 | 1c7c4138 |
14 | 125bd564 |
15 | acbd6ac |
hex | 75e4e94 |
123621012 has 48 divisors (see below), whose sum is σ = 323639680. Its totient is φ = 40803264.
The previous prime is 123621007. The next prime is 123621019. The reversal of 123621012 is 210126321.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123621019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5568 + ... + 16680.
Almost surely, 2123621012 is an apocalyptic number.
123621012 is a gapful number since it is divisible by the number (12) 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 123621012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161819840).
123621012 is an abundant number, since it is smaller than the sum of its proper divisors (200018668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123621012 is a wasteful number, since it uses less digits than its factorization.
123621012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11229 (or 11221 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 123621012 is about 11118.4986396545. The cubic root of 123621012 is about 498.1545463148.
Adding to 123621012 its reverse (210126321), we get a palindrome (333747333).
The spelling of 123621012 in words is "one hundred twenty-three million, six hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •