Base | Representation |
---|---|
bin | 11110101011110010111… |
… | …10110111100000010001 |
3 | 10201210100100002110200202 |
4 | 33111321132313200101 |
5 | 114233204102403241 |
6 | 2124201401424545 |
7 | 136112443450553 |
oct | 17257136674021 |
9 | 3653310073622 |
10 | 1054305122321 |
11 | 377145835080 |
12 | 1503b879b155 |
13 | 78560c2c409 |
14 | 390588354d3 |
15 | 1c659052d9b |
hex | f5797b7811 |
1054305122321 has 16 divisors (see below), whose sum is σ = 1179461400768. Its totient is φ = 934083820800.
The previous prime is 1054305122303. The next prime is 1054305122329. The reversal of 1054305122321 is 1232215034501.
It is a cyclic number.
It is not a de Polignac number, because 1054305122321 - 222 = 1054300928017 is a prime.
It is a super-2 number, since 2×10543051223212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1054305122329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 824855 + ... + 1670028.
It is an arithmetic number, because the mean of its divisors is an integer number (73716337548).
Almost surely, 21054305122321 is an apocalyptic number.
1054305122321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1054305122321 is a deficient number, since it is larger than the sum of its proper divisors (125156278447).
1054305122321 is a wasteful number, since it uses less digits than its factorization.
1054305122321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2495872.
The product of its (nonzero) digits is 7200, while the sum is 29.
The spelling of 1054305122321 in words is "one trillion, fifty-four billion, three hundred five million, one hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •