Base | Representation |
---|---|
bin | 1001010101011110… |
… | …10011110111111101 |
3 | 110221021222121200010 |
4 | 10222233103313331 |
5 | 40231033400131 |
6 | 2145200453433 |
7 | 235126255314 |
oct | 45257236775 |
9 | 13837877603 |
10 | 5012012541 |
11 | 2142172228 |
12 | b7a61a279 |
13 | 61b4a64c3 |
14 | 35790b27b |
15 | 1e502ab46 |
hex | 12abd3dfd |
5012012541 has 4 divisors (see below), whose sum is σ = 6682683392. Its totient is φ = 3341341692.
The previous prime is 5012012531. The next prime is 5012012567. The reversal of 5012012541 is 1452102105.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5012012541 - 26 = 5012012477 is a prime.
It is a super-2 number, since 2×50120125412 = 50240539422282553362, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5012012531) 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, 835335421 + ... + 835335426.
It is an arithmetic number, because the mean of its divisors is an integer number (1670670848).
Almost surely, 25012012541 is an apocalyptic number.
It is an amenable number.
5012012541 is a deficient number, since it is larger than the sum of its proper divisors (1670670851).
5012012541 is a wasteful number, since it uses less digits than its factorization.
5012012541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1670670850.
The product of its (nonzero) digits is 400, while the sum is 21.
The square root of 5012012541 is about 70795.5686536947. The cubic root of 5012012541 is about 1711.3442618761.
Adding to 5012012541 its reverse (1452102105), we get a palindrome (6464114646).
The spelling of 5012012541 in words is "five billion, twelve million, twelve thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •