Base | Representation |
---|---|
bin | 10101011011101011001000… |
… | …00000101010101011001001 |
3 | 20011212121200102000002120211 |
4 | 22231311210000222223021 |
5 | 22134140431113113101 |
6 | 244123215153121121 |
7 | 12633025052243410 |
oct | 1255654400525311 |
9 | 204777612002524 |
10 | 47130354035401 |
11 | 1402096419258a |
12 | 53522182591a1 |
13 | 203b4b1234800 |
14 | b8d19ac18477 |
15 | 56ae7e3b3c51 |
hex | 2add6402aac9 |
47130354035401 has 12 divisors (see below), whose sum is σ = 58325307108672. Its totient is φ = 37289950444656.
The previous prime is 47130354035399. The next prime is 47130354035417. The reversal of 47130354035401 is 10453045303174.
It is a happy number.
It is not a de Polignac number, because 47130354035401 - 21 = 47130354035399 is a prime.
It is a super-2 number, since 2×471303540354012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (47130354035201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19919844141 + ... + 19919846506.
It is an arithmetic number, because the mean of its divisors is an integer number (4860442259056).
Almost surely, 247130354035401 is an apocalyptic number.
It is an amenable number.
47130354035401 is a deficient number, since it is larger than the sum of its proper divisors (11194953073271).
47130354035401 is a wasteful number, since it uses less digits than its factorization.
47130354035401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39839690680 (or 39839690667 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 40.
Adding to 47130354035401 its reverse (10453045303174), we get a palindrome (57583399338575).
The spelling of 47130354035401 in words is "forty-seven trillion, one hundred thirty billion, three hundred fifty-four million, thirty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •