Base | Representation |
---|---|
bin | 100010111101010000110… |
… | …1100100011011001001011 |
3 | 122000022012220111110020112 |
4 | 1011322201230203121023 |
5 | 1112204041434414021 |
6 | 14115052302144535 |
7 | 1004053435201322 |
oct | 105724154433113 |
9 | 18008186443215 |
10 | 4804486248011 |
11 | 159263126394a |
12 | 65718488214b |
13 | 28b0a4345318 |
14 | 1287774310b9 |
15 | 84e98070d5b |
hex | 45ea1b2364b |
4804486248011 has 4 divisors (see below), whose sum is σ = 4817030598912. Its totient is φ = 4791941897112.
The previous prime is 4804486248007. The next prime is 4804486248041. The reversal of 4804486248011 is 1108426844084.
4804486248011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4804486248011 - 22 = 4804486248007 is a prime.
It is a super-2 number, since 2×48044862480112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4804486248041) 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, 6272174876 + ... + 6272175641.
It is an arithmetic number, because the mean of its divisors is an integer number (1204257649728).
Almost surely, 24804486248011 is an apocalyptic number.
4804486248011 is a deficient number, since it is larger than the sum of its proper divisors (12544350901).
4804486248011 is a wasteful number, since it uses less digits than its factorization.
4804486248011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12544350900.
The product of its (nonzero) digits is 1572864, while the sum is 50.
The spelling of 4804486248011 in words is "four trillion, eight hundred four billion, four hundred eighty-six million, two hundred forty-eight thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •