Base | Representation |
---|---|
bin | 11110101001111100011… |
… | …11000100001010110001 |
3 | 10201200210001201010112111 |
4 | 33110332033010022301 |
5 | 114224140121433040 |
6 | 2123515012525321 |
7 | 136046013554650 |
oct | 17247617041261 |
9 | 3650701633474 |
10 | 1053311124145 |
11 | 376785740585 |
12 | 15017b920841 |
13 | 78433014007 |
14 | 38da280b197 |
15 | 1c5ebb59dea |
hex | f53e3c42b1 |
1053311124145 has 8 divisors (see below), whose sum is σ = 1444540970304. Its totient is φ = 722270485104.
The previous prime is 1053311124127. The next prime is 1053311124149. The reversal of 1053311124145 is 5414211133501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1053311124145 - 27 = 1053311124017 is a prime.
It is a super-3 number, since 3×10533111241453 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1053311124149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15047301739 + ... + 15047301808.
It is an arithmetic number, because the mean of its divisors is an integer number (180567621288).
Almost surely, 21053311124145 is an apocalyptic number.
It is an amenable number.
1053311124145 is a deficient number, since it is larger than the sum of its proper divisors (391229846159).
1053311124145 is an equidigital number, since it uses as much as digits as its factorization.
1053311124145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30094603559.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 1053311124145 its reverse (5414211133501), we get a palindrome (6467522257646).
The spelling of 1053311124145 in words is "one trillion, fifty-three billion, three hundred eleven million, one hundred twenty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •