Base | Representation |
---|---|
bin | 101010011001001101… |
… | …011111000101101111 |
3 | 11100111101010210121201 |
4 | 222121031133011233 |
5 | 1221211122402343 |
6 | 32524530110331 |
7 | 3201013440412 |
oct | 523115370557 |
9 | 140441123551 |
10 | 45520122223 |
11 | 18339a16624 |
12 | 89a471b3a7 |
13 | 43a58c0184 |
14 | 22bb781b79 |
15 | 12b642d94d |
hex | a9935f16f |
45520122223 has 4 divisors (see below), whose sum is σ = 47089781640. Its totient is φ = 43950462808.
The previous prime is 45520122217. The next prime is 45520122229. The reversal of 45520122223 is 32222102554.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (45520122217) and next prime (45520122229).
It is a cyclic number.
It is not a de Polignac number, because 45520122223 - 25 = 45520122191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45520122191 and 45520122200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45520122229) 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, 784829665 + ... + 784829722.
It is an arithmetic number, because the mean of its divisors is an integer number (11772445410).
Almost surely, 245520122223 is an apocalyptic number.
45520122223 is a deficient number, since it is larger than the sum of its proper divisors (1569659417).
45520122223 is a wasteful number, since it uses less digits than its factorization.
45520122223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1569659416.
The product of its (nonzero) digits is 9600, while the sum is 28.
Adding to 45520122223 its reverse (32222102554), we get a palindrome (77742224777).
The spelling of 45520122223 in words is "forty-five billion, five hundred twenty million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •