Base | Representation |
---|---|
bin | 1110101100111… |
… | …10110101111101 |
3 | 22121002000110102 |
4 | 13112132311331 |
5 | 223033142023 |
6 | 20123250445 |
7 | 3025215245 |
oct | 726366575 |
9 | 277060412 |
10 | 123334013 |
11 | 63689740 |
12 | 35379a25 |
13 | 1c72360a |
14 | 12546b25 |
15 | ac63628 |
hex | 759ed7d |
123334013 has 16 divisors (see below), whose sum is σ = 141566400. Its totient is φ = 106404480.
The previous prime is 123333989. The next prime is 123334037. The reversal of 123334013 is 310433321.
It is an interprime number because it is at equal distance from previous prime (123333989) and next prime (123334037).
It is not a de Polignac number, because 123334013 - 28 = 123333757 is a prime.
It is a super-2 number, since 2×1233340132 = 30422557525368338, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123324013) 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, 15545 + ... + 22097.
It is an arithmetic number, because the mean of its divisors is an integer number (8847900).
Almost surely, 2123334013 is an apocalyptic number.
It is an amenable number.
123334013 is a deficient number, since it is larger than the sum of its proper divisors (18232387).
123334013 is a wasteful number, since it uses less digits than its factorization.
123334013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6652.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 123334013 is about 11105.5847662336. The cubic root of 123334013 is about 497.7687417847.
Adding to 123334013 its reverse (310433321), we get a palindrome (433767334).
The spelling of 123334013 in words is "one hundred twenty-three million, three hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •