Base | Representation |
---|---|
bin | 1001000000100010… |
… | …11101010110110101 |
3 | 110111001120022222211 |
4 | 10200101131112311 |
5 | 34401110234101 |
6 | 2115525053421 |
7 | 230564563663 |
oct | 44021352665 |
9 | 13431508884 |
10 | 4836414901 |
11 | 206203710a |
12 | b2b857271 |
13 | 5c0cb4386 |
14 | 33c47bc33 |
15 | 1d48e1c51 |
hex | 12045d5b5 |
4836414901 has 2 divisors, whose sum is σ = 4836414902. Its totient is φ = 4836414900.
The previous prime is 4836414887. The next prime is 4836414931. The reversal of 4836414901 is 1094146384.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3203446801 + 1632968100 = 56599^2 + 40410^2 .
It is a cyclic number.
It is not a de Polignac number, because 4836414901 - 27 = 4836414773 is a prime.
It is a super-2 number, since 2×48364149012 = 46781818189229679602, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4836414931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2418207450 + 2418207451.
It is an arithmetic number, because the mean of its divisors is an integer number (2418207451).
Almost surely, 24836414901 is an apocalyptic number.
It is an amenable number.
4836414901 is a deficient number, since it is larger than the sum of its proper divisors (1).
4836414901 is an equidigital number, since it uses as much as digits as its factorization.
4836414901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 40.
The square root of 4836414901 is about 69544.3376631053. The cubic root of 4836414901 is about 1691.1203547677.
The spelling of 4836414901 in words is "four billion, eight hundred thirty-six million, four hundred fourteen thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •