Base | Representation |
---|---|
bin | 100100101100011100010… |
… | …0010101001101100110101 |
3 | 122212010111002012112221201 |
4 | 1021120320202221230311 |
5 | 1130112023443311201 |
6 | 14420455500212501 |
7 | 1030235123340013 |
oct | 111307042515465 |
9 | 18763432175851 |
10 | 5043240213301 |
11 | 167490a694834 |
12 | 6954b6b3a131 |
13 | 2a7763524cb4 |
14 | 1361464098b3 |
15 | 8b2bd8eb801 |
hex | 496388a9b35 |
5043240213301 has 8 divisors (see below), whose sum is σ = 5332899172608. Its totient is φ = 4761517116000.
The previous prime is 5043240213281. The next prime is 5043240213311. The reversal of 5043240213301 is 1033120423405.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5043240213301 - 219 = 5043239689013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5043240213301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5043240213311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1983964195 + ... + 1983966736.
It is an arithmetic number, because the mean of its divisors is an integer number (666612396576).
Almost surely, 25043240213301 is an apocalyptic number.
It is an amenable number.
5043240213301 is a deficient number, since it is larger than the sum of its proper divisors (289658959307).
5043240213301 is a wasteful number, since it uses less digits than its factorization.
5043240213301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3967931003.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 5043240213301 its reverse (1033120423405), we get a palindrome (6076360636706).
The spelling of 5043240213301 in words is "five trillion, forty-three billion, two hundred forty million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •