Base | Representation |
---|---|
bin | 11100000011110111100100… |
… | …010100100110010101010011 |
3 | 121011221222200120000000220111 |
4 | 130003313210110212111103 |
5 | 112133431441213433412 |
6 | 1114250142155422151 |
7 | 34665105514130113 |
oct | 3403674424462523 |
9 | 534858616000814 |
10 | 123411125921107 |
11 | 36360401296502 |
12 | 11a11aa0454957 |
13 | 53b280861057b |
14 | 22691b7a17043 |
15 | e403174072a7 |
hex | 703de4526553 |
123411125921107 has 2 divisors, whose sum is σ = 123411125921108. Its totient is φ = 123411125921106.
The previous prime is 123411125920969. The next prime is 123411125921113. The reversal of 123411125921107 is 701129521114321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123411125921107 - 239 = 122861370107219 is a prime.
It is a super-2 number, since 2×1234111259211072 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123411125921107.
It is not a weakly prime, because it can be changed into another prime (123411125921807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61705562960553 + 61705562960554.
It is an arithmetic number, because the mean of its divisors is an integer number (61705562960554).
Almost surely, 2123411125921107 is an apocalyptic number.
123411125921107 is a deficient number, since it is larger than the sum of its proper divisors (1).
123411125921107 is an equidigital number, since it uses as much as digits as its factorization.
123411125921107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240, while the sum is 40.
The spelling of 123411125921107 in words is "one hundred twenty-three trillion, four hundred eleven billion, one hundred twenty-five million, nine hundred twenty-one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •