Base | Representation |
---|---|
bin | 111001010010000100… |
… | …1010110101101100011 |
3 | 102202111222122212112100 |
4 | 1302210021112231203 |
5 | 4003412312000120 |
6 | 132302243301443 |
7 | 11613243151032 |
oct | 1624411265543 |
9 | 382458585470 |
10 | 123013000035 |
11 | 481956a46a2 |
12 | 1ba1097a883 |
13 | b7a54a0b23 |
14 | 5d4d574719 |
15 | 32ee766490 |
hex | 1ca4256b63 |
123013000035 has 12 divisors (see below), whose sum is σ = 213222533472. Its totient is φ = 65606933328.
The previous prime is 123012999881. The next prime is 123013000039. The reversal of 123013000035 is 530000310321.
It is not a de Polignac number, because 123013000035 - 229 = 122476129123 is a prime.
It is a super-2 number, since 2×1230130000352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123012999981 and 123013000017.
It is not an unprimeable number, because it can be changed into a prime (123013000039) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1366811067 + ... + 1366811156.
It is an arithmetic number, because the mean of its divisors is an integer number (17768544456).
Almost surely, 2123013000035 is an apocalyptic number.
123013000035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
123013000035 is a deficient number, since it is larger than the sum of its proper divisors (90209533437).
123013000035 is a wasteful number, since it uses less digits than its factorization.
123013000035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2733622234 (or 2733622231 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 18.
Adding to 123013000035 its reverse (530000310321), we get a palindrome (653013310356).
The spelling of 123013000035 in words is "one hundred twenty-three billion, thirteen million, thirty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •