Base | Representation |
---|---|
bin | 1010011011011110… |
… | …10101110101010001 |
3 | 112110012221000011010 |
4 | 11031233111311101 |
5 | 42431400114441 |
6 | 2323334441133 |
7 | 255516416442 |
oct | 51557256521 |
9 | 15405830133 |
10 | 5599223121 |
11 | 2413685228 |
12 | 11032031a9 |
13 | 6b304499b |
14 | 3b18c52c9 |
15 | 22b86e116 |
hex | 14dbd5d51 |
5599223121 has 4 divisors (see below), whose sum is σ = 7465630832. Its totient is φ = 3732815412.
The previous prime is 5599223101. The next prime is 5599223137. The reversal of 5599223121 is 1213229955.
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.
It is not a de Polignac number, because 5599223121 - 25 = 5599223089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5599223121.
It is not an unprimeable number, because it can be changed into a prime (5599223101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 933203851 + ... + 933203856.
It is an arithmetic number, because the mean of its divisors is an integer number (1866407708).
Almost surely, 25599223121 is an apocalyptic number.
It is an amenable number.
5599223121 is a deficient number, since it is larger than the sum of its proper divisors (1866407711).
5599223121 is a wasteful number, since it uses less digits than its factorization.
5599223121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866407710.
The product of its digits is 48600, while the sum is 39.
The square root of 5599223121 is about 74827.9568142817. The cubic root of 5599223121 is about 1775.7258813574.
The spelling of 5599223121 in words is "five billion, five hundred ninety-nine million, two hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •