Base | Representation |
---|---|
bin | 1000111101010001… |
… | …11001110101001001 |
3 | 110102010222211121111 |
4 | 10132220321311021 |
5 | 34322101201114 |
6 | 2113105410321 |
7 | 230112610564 |
oct | 43650716511 |
9 | 13363884544 |
10 | 4809006409 |
11 | 2048616769 |
12 | b226399a1 |
13 | 5b8408b2c |
14 | 3389854db |
15 | 1d22cabc4 |
hex | 11ea39d49 |
4809006409 has 9 divisors (see below), whose sum is σ = 4971362151. Its totient is φ = 4651796760.
The previous prime is 4809006407. The next prime is 4809006467. The reversal of 4809006409 is 9046009084.
The square root of 4809006409 is 69347.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3824804025 + 984202384 = 61845^2 + 31372^2 .
It is not a de Polignac number, because 4809006409 - 21 = 4809006407 is a prime.
It is a super-3 number, since 3×48090064093 (a number of 30 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (4809006401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2148639 + ... + 2150875.
Almost surely, 24809006409 is an apocalyptic number.
4809006409 is the 69347-th square number.
4809006409 is the 34674-th centered octagonal number.
It is an amenable number.
4809006409 is a deficient number, since it is larger than the sum of its proper divisors (162355742).
4809006409 is an frugal number, since it uses more digits than its factorization.
4809006409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4536 (or 2268 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 40.
The cubic root of 4809006409 is about 1687.9197130238.
The spelling of 4809006409 in words is "four billion, eight hundred nine million, six thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •