Base | Representation |
---|---|
bin | 100111010100000001001… |
… | …1101000010000011100101 |
3 | 201010112101000202001110202 |
4 | 1032220002131002003211 |
5 | 1202011032131222042 |
6 | 15254053211200245 |
7 | 1065235050265562 |
oct | 116500235020345 |
9 | 21115330661422 |
10 | 5403110023397 |
11 | 17a349a827529 |
12 | 7331aa746085 |
13 | 302684b29a28 |
14 | 1497249d1869 |
15 | 95832193632 |
hex | 4ea027420e5 |
5403110023397 has 2 divisors, whose sum is σ = 5403110023398. Its totient is φ = 5403110023396.
The previous prime is 5403110023387. The next prime is 5403110023411. The reversal of 5403110023397 is 7933200113045.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5301556905121 + 101553118276 = 2302511^2 + 318674^2 .
It is a cyclic number.
It is not a de Polignac number, because 5403110023397 - 220 = 5403108974821 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5403110023397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5403110023387) 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 as a sum of consecutive naturals, namely, 2701555011698 + 2701555011699.
It is an arithmetic number, because the mean of its divisors is an integer number (2701555011699).
Almost surely, 25403110023397 is an apocalyptic number.
It is an amenable number.
5403110023397 is a deficient number, since it is larger than the sum of its proper divisors (1).
5403110023397 is an equidigital number, since it uses as much as digits as its factorization.
5403110023397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 38.
The spelling of 5403110023397 in words is "five trillion, four hundred three billion, one hundred ten million, twenty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •