Base | Representation |
---|---|
bin | 101001110010010110111… |
… | …0110010010111111101110 |
3 | 202100001001100001010111210 |
4 | 1103210231312102333232 |
5 | 1223043422430424204 |
6 | 20114210132055250 |
7 | 1131633242433552 |
oct | 123445566227756 |
9 | 22301040033453 |
10 | 5743140483054 |
11 | 191471a096637 |
12 | 789086164526 |
13 | 328764114150 |
14 | 15bd8038d862 |
15 | 9e5d3d54389 |
hex | 5392dd92fee |
5743140483054 has 64 divisors (see below), whose sum is σ = 12494185853184. Its totient is φ = 1749379727616.
The previous prime is 5743140483043. The next prime is 5743140483077. The reversal of 5743140483054 is 4503840413475.
It is a super-2 number, since 2×57431404830542 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5743140482994 and 5743140483012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11719717 + ... + 12199919.
It is an arithmetic number, because the mean of its divisors is an integer number (195221653956).
Almost surely, 25743140483054 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5743140483054, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6247092926592).
5743140483054 is an abundant number, since it is smaller than the sum of its proper divisors (6751045370130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5743140483054 is a wasteful number, since it uses less digits than its factorization.
5743140483054 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481761.
The product of its (nonzero) digits is 3225600, while the sum is 48.
The spelling of 5743140483054 in words is "five trillion, seven hundred forty-three billion, one hundred forty million, four hundred eighty-three thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.410 sec. • engine limits •