Base | Representation |
---|---|
bin | 100100101000010100110… |
… | …1000000010111011101001 |
3 | 122211021122222211221110102 |
4 | 1021100221220002323221 |
5 | 1124440422402101122 |
6 | 14412434344355145 |
7 | 1026503061142046 |
oct | 111205150027351 |
9 | 18737588757412 |
10 | 5034400034537 |
11 | 1671093633675 |
12 | 69384a475ab5 |
13 | 2a6984c01ca3 |
14 | 1359483181cd |
15 | 8ae5278e492 |
hex | 49429a02ee9 |
5034400034537 has 2 divisors, whose sum is σ = 5034400034538. Its totient is φ = 5034400034536.
The previous prime is 5034400034513. The next prime is 5034400034579. The reversal of 5034400034537 is 7354300044305.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4125464703376 + 908935331161 = 2031124^2 + 953381^2 .
It is a cyclic number.
It is not a de Polignac number, because 5034400034537 - 210 = 5034400033513 is a prime.
It is a super-3 number, since 3×50344000345373 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 5034400034537.
It is not a weakly prime, because it can be changed into another prime (5034400034737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2517200017268 + 2517200017269.
It is an arithmetic number, because the mean of its divisors is an integer number (2517200017269).
Almost surely, 25034400034537 is an apocalyptic number.
It is an amenable number.
5034400034537 is a deficient number, since it is larger than the sum of its proper divisors (1).
5034400034537 is an equidigital number, since it uses as much as digits as its factorization.
5034400034537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 302400, while the sum is 38.
The spelling of 5034400034537 in words is "five trillion, thirty-four billion, four hundred million, thirty-four thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •