Base | Representation |
---|---|
bin | 1001010101101010… |
… | …00000001000100010 |
3 | 110221101210102022120 |
4 | 10222311000020202 |
5 | 40231424121141 |
6 | 2145252445110 |
7 | 235145041221 |
oct | 45265001042 |
9 | 13841712276 |
10 | 5013504546 |
11 | 2142aa1196 |
12 | b7b019796 |
13 | 61b8a964b |
14 | 357bb8cb8 |
15 | 1e5222c66 |
hex | 12ad40222 |
5013504546 has 8 divisors (see below), whose sum is σ = 10027009104. Its totient is φ = 1671168180.
The previous prime is 5013504533. The next prime is 5013504593. The reversal of 5013504546 is 6454053105.
It is a sphenic number, since it is the product of 3 distinct primes.
5013504546 is an admirable number.
It is a super-2 number, since 2×50135045462 = 50270455665525332232, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417792040 + ... + 417792051.
It is an arithmetic number, because the mean of its divisors is an integer number (1253376138).
Almost surely, 25013504546 is an apocalyptic number.
5013504546 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5013504546 is a wasteful number, since it uses less digits than its factorization.
5013504546 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835584096.
The product of its (nonzero) digits is 36000, while the sum is 33.
The square root of 5013504546 is about 70806.1052876092. The cubic root of 5013504546 is about 1711.5140593279.
It can be divided in two parts, 50135045 and 46, that added together give a triangular number (50135091 = T10013).
The spelling of 5013504546 in words is "five billion, thirteen million, five hundred four thousand, five hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.848 sec. • engine limits •