Base | Representation |
---|---|
bin | 111001010010000100… |
… | …1110100000010000010 |
3 | 102202111222212222021022 |
4 | 1302210021310002002 |
5 | 4003412324321010 |
6 | 132302250025442 |
7 | 11613244161125 |
oct | 1624411640202 |
9 | 382458788238 |
10 | 123013120130 |
11 | 4819577694a |
12 | 1ba10a18282 |
13 | b7a55136a4 |
14 | 5d4d5a63bc |
15 | 32ee78bd55 |
hex | 1ca4274082 |
123013120130 has 32 divisors (see below), whose sum is σ = 234471769200. Its totient is φ = 46306232320.
The previous prime is 123013120129. The next prime is 123013120157. The reversal of 123013120130 is 31021310321.
It can be written as a sum of positive squares in 8 ways, for example, as 123006622729 + 6497401 = 350723^2 + 2549^2 .
It is a super-2 number, since 2×1230131201302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 123013120099 and 123013120108.
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 15 ways as a sum of consecutive naturals, for example, 2035550 + ... + 2095110.
Almost surely, 2123013120130 is an apocalyptic number.
123013120130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
123013120130 is a deficient number, since it is larger than the sum of its proper divisors (111458649070).
123013120130 is a wasteful number, since it uses less digits than its factorization.
123013120130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71734.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 123013120130 its reverse (31021310321), we get a palindrome (154034430451).
The spelling of 123013120130 in words is "one hundred twenty-three billion, thirteen million, one hundred twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •