Base | Representation |
---|---|
bin | 101100001001110111… |
… | …001101010000001001 |
3 | 11112101002110222212202 |
4 | 230021313031100021 |
5 | 1234043441414101 |
6 | 33440243045545 |
7 | 3265603156316 |
oct | 541167152011 |
9 | 145332428782 |
10 | 47410107401 |
11 | 19119851448 |
12 | 92316708b5 |
13 | 46173284b7 |
14 | 241a79dd0d |
15 | 137730e36b |
hex | b09dcd409 |
47410107401 has 4 divisors (see below), whose sum is σ = 47419450692. Its totient is φ = 47400764112.
The previous prime is 47410107389. The next prime is 47410107413. The reversal of 47410107401 is 10470101474.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (47410107389) and next prime (47410107413).
It can be written as a sum of positive squares in 2 ways, for example, as 41026097401 + 6384010000 = 202549^2 + 79900^2 .
It is a cyclic number.
It is not a de Polignac number, because 47410107401 - 234 = 30230238217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (47410107431) 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, 4664030 + ... + 4674183.
It is an arithmetic number, because the mean of its divisors is an integer number (11854862673).
Almost surely, 247410107401 is an apocalyptic number.
It is an amenable number.
47410107401 is a deficient number, since it is larger than the sum of its proper divisors (9343291).
47410107401 is an equidigital number, since it uses as much as digits as its factorization.
47410107401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9343290.
The product of its (nonzero) digits is 3136, while the sum is 29.
Adding to 47410107401 its reverse (10470101474), we get a palindrome (57880208875).
The spelling of 47410107401 in words is "forty-seven billion, four hundred ten million, one hundred seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •