Base | Representation |
---|---|
bin | 111001000000110100… |
… | …0101100100000011101 |
3 | 102201000122012021220222 |
4 | 1302001220230200131 |
5 | 4001221101410323 |
6 | 132125001451125 |
7 | 11563012640561 |
oct | 1620150544035 |
9 | 381018167828 |
10 | 122434013213 |
11 | 47a18899296 |
12 | 1b88aaa0aa5 |
13 | b712551885 |
14 | 5cd66db6a1 |
15 | 32b89e99c8 |
hex | 1c81a2c81d |
122434013213 has 8 divisors (see below), whose sum is σ = 124762693176. Its totient is φ = 120106022400.
The previous prime is 122434013201. The next prime is 122434013239. The reversal of 122434013213 is 312310434221.
It can be written as a sum of positive squares in 4 ways, for example, as 74017731844 + 48416281369 = 272062^2 + 220037^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122434013213 - 28 = 122434012957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122434013293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193733 + ... + 531413.
It is an arithmetic number, because the mean of its divisors is an integer number (15595336647).
Almost surely, 2122434013213 is an apocalyptic number.
It is an amenable number.
122434013213 is a deficient number, since it is larger than the sum of its proper divisors (2328679963).
122434013213 is an equidigital number, since it uses as much as digits as its factorization.
122434013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344575.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 122434013213 its reverse (312310434221), we get a palindrome (434744447434).
The spelling of 122434013213 in words is "one hundred twenty-two billion, four hundred thirty-four million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •