Base | Representation |
---|---|
bin | 101000010110001101000… |
… | …0011111110100010011101 |
3 | 201122010020022102110001222 |
4 | 1100230122003332202131 |
5 | 1211323122421414331 |
6 | 15443240442343125 |
7 | 1111426134354005 |
oct | 120543203764235 |
9 | 21563208373058 |
10 | 5545240029341 |
11 | 18487a5483661 |
12 | 7568557baaa5 |
13 | 312bb5a8446c |
14 | 15256907b005 |
15 | 9939eda7b7b |
hex | 50b1a0fe89d |
5545240029341 has 2 divisors, whose sum is σ = 5545240029342. Its totient is φ = 5545240029340.
The previous prime is 5545240029331. The next prime is 5545240029349. The reversal of 5545240029341 is 1439200425455.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3604871822500 + 1940368206841 = 1898650^2 + 1392971^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5545240029341 is a prime.
It is a super-4 number, since 4×55452400293414 (a number of 52 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5545240029292 and 5545240029301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5545240029349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2772620014670 + 2772620014671.
It is an arithmetic number, because the mean of its divisors is an integer number (2772620014671).
Almost surely, 25545240029341 is an apocalyptic number.
It is an amenable number.
5545240029341 is a deficient number, since it is larger than the sum of its proper divisors (1).
5545240029341 is an equidigital number, since it uses as much as digits as its factorization.
5545240029341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864000, while the sum is 44.
The spelling of 5545240029341 in words is "five trillion, five hundred forty-five billion, two hundred forty million, twenty-nine thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •