Base | Representation |
---|---|
bin | 111001010010101010… |
… | …1110001001000111110 |
3 | 102202120101100120011110 |
4 | 1302211111301020332 |
5 | 4003432423444410 |
6 | 132304240502450 |
7 | 11613605340024 |
oct | 1624525611076 |
9 | 382511316143 |
10 | 123033031230 |
11 | 481a5a363aa |
12 | 1ba1761aa26 |
13 | b7a96954c5 |
14 | 5d520aa714 |
15 | 33013c1720 |
hex | 1ca557123e |
123033031230 has 32 divisors (see below), whose sum is σ = 296928892800. Its totient is φ = 32625517472.
The previous prime is 123033031127. The next prime is 123033031237. The reversal of 123033031230 is 32130330321.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 123033031197 and 123033031206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123033031237) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 11450220 + ... + 11460959.
It is an arithmetic number, because the mean of its divisors is an integer number (9279027900).
Almost surely, 2123033031230 is an apocalyptic number.
123033031230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
123033031230 is an abundant number, since it is smaller than the sum of its proper divisors (173895861570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123033031230 is a wasteful number, since it uses less digits than its factorization.
123033031230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22911368.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 123033031230 its reverse (32130330321), we get a palindrome (155163361551).
The spelling of 123033031230 in words is "one hundred twenty-three billion, thirty-three million, thirty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •