Base | Representation |
---|---|
bin | 100100110000110001010… |
… | …0101001000010000101111 |
3 | 122220000110212211000110012 |
4 | 1021201202211020100233 |
5 | 1130240043033043211 |
6 | 14425034105203435 |
7 | 1031014352431403 |
oct | 111414245102057 |
9 | 18800425730405 |
10 | 5052535440431 |
11 | 167884a59a526 |
12 | 69726ba9057b |
13 | 2a85b51c17ab |
14 | 136788b11103 |
15 | 8b664992d8b |
hex | 4986294842f |
5052535440431 has 4 divisors (see below), whose sum is σ = 5074598914200. Its totient is φ = 5030471966664.
The previous prime is 5052535440419. The next prime is 5052535440439. The reversal of 5052535440431 is 1340445352505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5052535440431 is a prime.
It is a super-2 number, since 2×50525354404312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5052535440439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11031736541 + ... + 11031736998.
It is an arithmetic number, because the mean of its divisors is an integer number (1268649728550).
Almost surely, 25052535440431 is an apocalyptic number.
5052535440431 is a deficient number, since it is larger than the sum of its proper divisors (22063473769).
5052535440431 is a wasteful number, since it uses less digits than its factorization.
5052535440431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22063473768.
The product of its (nonzero) digits is 720000, while the sum is 41.
The spelling of 5052535440431 in words is "five trillion, fifty-two billion, five hundred thirty-five million, four hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •