Base | Representation |
---|---|
bin | 1000011001000110… |
… | …10001111000111001 |
3 | 102121222222020222101 |
4 | 10030203101320321 |
5 | 33211404322301 |
6 | 2023025223401 |
7 | 216436322356 |
oct | 41443217071 |
9 | 12558866871 |
10 | 4505542201 |
11 | 1a022965a6 |
12 | a58a91b61 |
13 | 56a597304 |
14 | 30a54d62d |
15 | 1b5835701 |
hex | 10c8d1e39 |
4505542201 has 4 divisors (see below), whose sum is σ = 4650882304. Its totient is φ = 4360202100.
The previous prime is 4505542177. The next prime is 4505542213. The reversal of 4505542201 is 1022455054.
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 a cyclic number.
It is not a de Polignac number, because 4505542201 - 215 = 4505509433 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 4505542201.
It is not an unprimeable number, because it can be changed into a prime (4505542231) 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, 72670005 + ... + 72670066.
It is an arithmetic number, because the mean of its divisors is an integer number (1162720576).
Almost surely, 24505542201 is an apocalyptic number.
It is an amenable number.
4505542201 is a deficient number, since it is larger than the sum of its proper divisors (145340103).
4505542201 is a wasteful number, since it uses less digits than its factorization.
4505542201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145340102.
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 4505542201 is about 67123.3357410074. The cubic root of 4505542201 is about 1651.6411221102.
Adding to 4505542201 its reverse (1022455054), we get a palindrome (5527997255).
The spelling of 4505542201 in words is "four billion, five hundred five million, five hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •