Base | Representation |
---|---|
bin | 111001000111000100… |
… | …0000001000011110101 |
3 | 102201120020110212222111 |
4 | 1302032020001003311 |
5 | 4002133222103303 |
6 | 132201444531021 |
7 | 11601135656404 |
oct | 1621610010365 |
9 | 381506425874 |
10 | 122643550453 |
11 | 480160a5766 |
12 | 1b9290b0a71 |
13 | b746a97bc8 |
14 | 5d1648363b |
15 | 32cc0d9b6d |
hex | 1c8e2010f5 |
122643550453 has 4 divisors (see below), whose sum is σ = 126599794048. Its totient is φ = 118687306860.
The previous prime is 122643550429. The next prime is 122643550459. The reversal of 122643550453 is 354055346221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 354055346221 = 809 ⋅437645669.
It is a cyclic number.
It is not a de Polignac number, because 122643550453 - 225 = 122609996021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122643550459) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1978121751 + ... + 1978121812.
It is an arithmetic number, because the mean of its divisors is an integer number (31649948512).
Almost surely, 2122643550453 is an apocalyptic number.
It is an amenable number.
122643550453 is a deficient number, since it is larger than the sum of its proper divisors (3956243595).
122643550453 is an equidigital number, since it uses as much as digits as its factorization.
122643550453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3956243594.
The product of its (nonzero) digits is 432000, while the sum is 40.
Adding to 122643550453 its reverse (354055346221), we get a palindrome (476698896674).
The spelling of 122643550453 in words is "one hundred twenty-two billion, six hundred forty-three million, five hundred fifty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •