Base | Representation |
---|---|
bin | 111001011101111110… |
… | …1111011111110100101 |
3 | 102210112211200201010012 |
4 | 1302323331323332211 |
5 | 4010222120111013 |
6 | 132410041340005 |
7 | 11626165205600 |
oct | 1627375737645 |
9 | 383484621105 |
10 | 123412660133 |
11 | 483802581a4 |
12 | 1bb02797605 |
13 | b83a2237a9 |
14 | 5d8a68b337 |
15 | 33248ae1a8 |
hex | 1cbbf7bfa5 |
123412660133 has 12 divisors (see below), whose sum is σ = 143567419392. Its totient is φ = 105778040760.
The previous prime is 123412660127. The next prime is 123412660141. The reversal of 123412660133 is 331066214321.
It is a de Polignac number, because none of the positive numbers 2k-123412660133 is a prime.
It is a super-2 number, since 2×1234126601332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123412660133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123412660153) 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, 2183516 + ... + 2239322.
It is an arithmetic number, because the mean of its divisors is an integer number (11963951616).
Almost surely, 2123412660133 is an apocalyptic number.
It is an amenable number.
123412660133 is a deficient number, since it is larger than the sum of its proper divisors (20154759259).
123412660133 is an equidigital number, since it uses as much as digits as its factorization.
123412660133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100952 (or 100945 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 123412660133 its reverse (331066214321), we get a palindrome (454478874454).
The spelling of 123412660133 in words is "one hundred twenty-three billion, four hundred twelve million, six hundred sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •