Base | Representation |
---|---|
bin | 11100000010100101101100… |
… | …010011100101000111100011 |
3 | 121011122120202202102001121102 |
4 | 130002211230103211013203 |
5 | 112131011420014322042 |
6 | 1114141522453345015 |
7 | 34655544120030416 |
oct | 3402455423450743 |
9 | 534576682361542 |
10 | 123323213042147 |
11 | 36327098807338 |
12 | 119b8a4663816b |
13 | 53a743801a071 |
14 | 2264c37db1b7d |
15 | e3cdbe3ebb32 |
hex | 70296c4e51e3 |
123323213042147 has 2 divisors, whose sum is σ = 123323213042148. Its totient is φ = 123323213042146.
The previous prime is 123323213042083. The next prime is 123323213042167. The reversal of 123323213042147 is 741240312323321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123323213042147 - 26 = 123323213042083 is a prime.
It is a super-2 number, since 2×1233232130421472 (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 123323213042147.
It is not a weakly prime, because it can be changed into another prime (123323213042167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61661606521073 + 61661606521074.
It is an arithmetic number, because the mean of its divisors is an integer number (61661606521074).
Almost surely, 2123323213042147 is an apocalyptic number.
123323213042147 is a deficient number, since it is larger than the sum of its proper divisors (1).
123323213042147 is an equidigital number, since it uses as much as digits as its factorization.
123323213042147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 38.
Adding to 123323213042147 its reverse (741240312323321), we get a palindrome (864563525365468).
The spelling of 123323213042147 in words is "one hundred twenty-three trillion, three hundred twenty-three billion, two hundred thirteen million, forty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •