Base | Representation |
---|---|
bin | 1000011111000000… |
… | …11010100110110001 |
3 | 102202110021020012202 |
4 | 10033200122212301 |
5 | 33312102414441 |
6 | 2032000032545 |
7 | 220610623223 |
oct | 41740324661 |
9 | 12673236182 |
10 | 4555123121 |
11 | 1a2828046a |
12 | a71602755 |
13 | 577936a33 |
14 | 312d78413 |
15 | 1b9d7b19b |
hex | 10f81a9b1 |
4555123121 has 4 divisors (see below), whose sum is σ = 4561459200. Its totient is φ = 4548787044.
The previous prime is 4555123109. The next prime is 4555123127. The reversal of 4555123121 is 1213215554.
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: 1213215554 = 2 ⋅606607777.
It is a cyclic number.
It is not a de Polignac number, because 4555123121 - 26 = 4555123057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4555123127) 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, 3166961 + ... + 3168398.
It is an arithmetic number, because the mean of its divisors is an integer number (1140364800).
Almost surely, 24555123121 is an apocalyptic number.
It is an amenable number.
4555123121 is a deficient number, since it is larger than the sum of its proper divisors (6336079).
4555123121 is an equidigital number, since it uses as much as digits as its factorization.
4555123121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6336078.
The product of its digits is 6000, while the sum is 29.
The square root of 4555123121 is about 67491.6522319613. The cubic root of 4555123121 is about 1657.6774896134.
Adding to 4555123121 its reverse (1213215554), we get a palindrome (5768338675).
The spelling of 4555123121 in words is "four billion, five hundred fifty-five million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •