Base | Representation |
---|---|
bin | 111001010001111111… |
… | …0101011000111011110 |
3 | 102202111210101121122110 |
4 | 1302203332223013132 |
5 | 4003411102400110 |
6 | 132302103254450 |
7 | 11613210306534 |
oct | 1624376530736 |
9 | 382453347573 |
10 | 123010200030 |
11 | 48194061a43 |
12 | 1ba0ba4a426 |
13 | b7a4a30513 |
14 | 5d4d046154 |
15 | 32ee3b1a20 |
hex | 1ca3fab1de |
123010200030 has 32 divisors (see below), whose sum is σ = 296623663488. Its totient is φ = 32647255200.
The previous prime is 123010200029. The next prime is 123010200043. The reversal of 123010200030 is 30002010321.
It is a happy number.
It is a super-2 number, since 2×1230102000302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123010199979 and 123010200015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9710116 + ... + 9722775.
It is an arithmetic number, because the mean of its divisors is an integer number (9269489484).
Almost surely, 2123010200030 is an apocalyptic number.
123010200030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
123010200030 is an abundant number, since it is smaller than the sum of its proper divisors (173613463458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123010200030 is a wasteful number, since it uses less digits than its factorization.
123010200030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19433112.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 123010200030 its reverse (30002010321), we get a palindrome (153012210351).
The spelling of 123010200030 in words is "one hundred twenty-three billion, ten million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •