Base | Representation |
---|---|
bin | 11100000011111001100000… |
… | …100011001110011101011101 |
3 | 121011222012001210210211101102 |
4 | 130003321200203032131131 |
5 | 112134000223243132034 |
6 | 1114251125051322445 |
7 | 34665211252455503 |
oct | 3403714043163535 |
9 | 534865053724342 |
10 | 123413210130269 |
11 | 36361280819714 |
12 | 11a12382450425 |
13 | 53b2a7b35cb27 |
14 | 2269334752673 |
15 | e403da3a097e |
hex | 703e608ce75d |
123413210130269 has 2 divisors, whose sum is σ = 123413210130270. Its totient is φ = 123413210130268.
The previous prime is 123413210130241. The next prime is 123413210130313. The reversal of 123413210130269 is 962031012314321.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100813045924900 + 22600164205369 = 10040570^2 + 4753963^2 .
It is a cyclic number.
It is not a de Polignac number, because 123413210130269 - 28 = 123413210130013 is a prime.
It is a super-2 number, since 2×1234132101302692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123413210130569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61706605065134 + 61706605065135.
It is an arithmetic number, because the mean of its divisors is an integer number (61706605065135).
Almost surely, 2123413210130269 is an apocalyptic number.
It is an amenable number.
123413210130269 is a deficient number, since it is larger than the sum of its proper divisors (1).
123413210130269 is an equidigital number, since it uses as much as digits as its factorization.
123413210130269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46656, while the sum is 38.
The spelling of 123413210130269 in words is "one hundred twenty-three trillion, four hundred thirteen billion, two hundred ten million, one hundred thirty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •