Base | Representation |
---|---|
bin | 1110101010011… |
… | …10110000111101 |
3 | 22120110100112021 |
4 | 13111032300331 |
5 | 222442143023 |
6 | 20112240141 |
7 | 3022351054 |
oct | 725166075 |
9 | 276410467 |
10 | 123006013 |
11 | 63485269 |
12 | 35240051 |
13 | 1c63a230 |
14 | 1249d39b |
15 | abeb35d |
hex | 754ec3d |
123006013 has 8 divisors (see below), whose sum is σ = 132564600. Its totient is φ = 113461248.
The previous prime is 123005989. The next prime is 123006017. The reversal of 123006013 is 310600321.
It can be written as a sum of positive squares in 4 ways, for example, as 3694084 + 119311929 = 1922^2 + 10923^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123006013 - 225 = 89451581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123006017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22053 + ... + 27061.
It is an arithmetic number, because the mean of its divisors is an integer number (16570575).
Almost surely, 2123006013 is an apocalyptic number.
123006013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
123006013 is a deficient number, since it is larger than the sum of its proper divisors (9558587).
123006013 is a wasteful number, since it uses less digits than its factorization.
123006013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6911.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 123006013 is about 11090.8075900721. The cubic root of 123006013 is about 497.3270872031.
Adding to 123006013 its reverse (310600321), we get a palindrome (433606334).
The spelling of 123006013 in words is "one hundred twenty-three million, six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •