Base | Representation |
---|---|
bin | 1001010100101001… |
… | …10010101110001001 |
3 | 110220210220102221200 |
4 | 10222110302232021 |
5 | 40222243423001 |
6 | 2144351454413 |
7 | 235013213403 |
oct | 45224625611 |
9 | 13823812850 |
10 | 5005061001 |
11 | 2139254456 |
12 | b78227409 |
13 | 619c11375 |
14 | 356a1bb73 |
15 | 1e4606086 |
hex | 12a532b89 |
5005061001 has 48 divisors (see below), whose sum is σ = 7796880000. Its totient is φ = 3082489344.
The previous prime is 5005060969. The next prime is 5005061057. The reversal of 5005061001 is 1001605005.
5005061001 is a `hidden beast` number, since 5 + 0 + 0 + 50 + 610 + 0 + 1 = 666.
It is not a de Polignac number, because 5005061001 - 25 = 5005060969 is a prime.
It is a super-2 number, since 2×50050610012 = 50101271247462244002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5005060001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3576900 + ... + 3578298.
It is an arithmetic number, because the mean of its divisors is an integer number (162435000).
Almost surely, 25005061001 is an apocalyptic number.
5005061001 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5005061001 is a deficient number, since it is larger than the sum of its proper divisors (2791818999).
5005061001 is a wasteful number, since it uses less digits than its factorization.
5005061001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838 (or 1835 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 5005061001 is about 70746.4557486804. The cubic root of 5005061001 is about 1710.5526981229.
Adding to 5005061001 its reverse (1001605005), we get a palindrome (6006666006).
The spelling of 5005061001 in words is "five billion, five million, sixty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •