Base | Representation |
---|---|
bin | 100100101000010010001… |
… | …0100111100111011100100 |
3 | 122211021102210120210101110 |
4 | 1021100210110330323210 |
5 | 1124440232123040030 |
6 | 14412421451225020 |
7 | 1026500631444336 |
oct | 111204424747344 |
9 | 18737383523343 |
10 | 5034311143140 |
11 | 167104843a204 |
12 | 693824748170 |
13 | 2a696c67a826 |
14 | 13593a5b9456 |
15 | 8ae49a811b0 |
hex | 4942453cee4 |
5034311143140 has 48 divisors (see below), whose sum is σ = 14708943865728. Its totient is φ = 1284114146304.
The previous prime is 5034311143097. The next prime is 5034311143151. The reversal of 5034311143140 is 413411134305.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5034311143098 and 5034311143107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1824024397 + ... + 1824027156.
It is an arithmetic number, because the mean of its divisors is an integer number (306436330536).
Almost surely, 25034311143140 is an apocalyptic number.
It is an amenable number.
5034311143140 is an abundant number, since it is smaller than the sum of its proper divisors (9674632722588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5034311143140 is a wasteful number, since it uses less digits than its factorization.
5034311143140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3648051588 (or 3648051586 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 5034311143140 its reverse (413411134305), we get a palindrome (5447722277445).
The spelling of 5034311143140 in words is "five trillion, thirty-four billion, three hundred eleven million, one hundred forty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •