Base | Representation |
---|---|
bin | 1001100000100100… |
… | …00100011011100001 |
3 | 111011202222101202022 |
4 | 10300102010123201 |
5 | 40423340313101 |
6 | 2202322031225 |
7 | 240335605151 |
oct | 46022043341 |
9 | 14152871668 |
10 | 5105010401 |
11 | 218a710967 |
12 | ba57a8515 |
13 | 634837b1a |
14 | 365dd8761 |
15 | 1ed29aa1b |
hex | 1304846e1 |
5105010401 has 2 divisors, whose sum is σ = 5105010402. Its totient is φ = 5105010400.
The previous prime is 5105010349. The next prime is 5105010431. The reversal of 5105010401 is 1040105015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4964611600 + 140398801 = 70460^2 + 11849^2 .
It is a cyclic number.
It is not a de Polignac number, because 5105010401 - 214 = 5104994017 is a prime.
It is a super-2 number, since 2×51050104012 = 52122262388636361602, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5105010401.
It is not a weakly prime, because it can be changed into another prime (5105010431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552505200 + 2552505201.
It is an arithmetic number, because the mean of its divisors is an integer number (2552505201).
Almost surely, 25105010401 is an apocalyptic number.
It is an amenable number.
5105010401 is a deficient number, since it is larger than the sum of its proper divisors (1).
5105010401 is an equidigital number, since it uses as much as digits as its factorization.
5105010401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 5105010401 is about 71449.3554974431. The cubic root of 5105010401 is about 1721.8641229221.
Adding to 5105010401 its reverse (1040105015), we get a palindrome (6145115416).
The spelling of 5105010401 in words is "five billion, one hundred five million, ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •