Base | Representation |
---|---|
bin | 100100101000101101110… |
… | …1101011001111011010001 |
3 | 122211100211112221212022102 |
4 | 1021101123231121323101 |
5 | 1124444133004101431 |
6 | 14413054002250145 |
7 | 1026532643241224 |
oct | 111213355317321 |
9 | 18740745855272 |
10 | 5035240300241 |
11 | 1671484976738 |
12 | 693a43956955 |
13 | 2a6a8a012628 |
14 | 1359c7b655bb |
15 | 8aea141bdcb |
hex | 4945bb59ed1 |
5035240300241 has 8 divisors (see below), whose sum is σ = 5088028478400. Its totient is φ = 4982558230768.
The previous prime is 5035240300231. The next prime is 5035240300247. The reversal of 5035240300241 is 1420030425305.
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 5035240300241 - 242 = 637193789137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5035240300247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26431766 + ... + 26621583.
It is an arithmetic number, because the mean of its divisors is an integer number (636003559800).
Almost surely, 25035240300241 is an apocalyptic number.
It is an amenable number.
5035240300241 is a deficient number, since it is larger than the sum of its proper divisors (52788178159).
5035240300241 is a wasteful number, since it uses less digits than its factorization.
5035240300241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53054343.
The product of its (nonzero) digits is 14400, while the sum is 29.
Adding to 5035240300241 its reverse (1420030425305), we get a palindrome (6455270725546).
The spelling of 5035240300241 in words is "five trillion, thirty-five billion, two hundred forty million, three hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •