Base | Representation |
---|---|
bin | 11110101001111110011… |
… | …00000011100010000001 |
3 | 10201200211011210102012011 |
4 | 33110333030003202001 |
5 | 114224203220043241 |
6 | 2123520343332521 |
7 | 136046266504501 |
oct | 17247714034201 |
9 | 3650734712164 |
10 | 1053327112321 |
11 | 376793770750 |
12 | 150185151141 |
13 | 78436421383 |
14 | 38da49ada01 |
15 | 1c5ed267281 |
hex | f53f303881 |
1053327112321 has 32 divisors (see below), whose sum is σ = 1184223427200. Its totient is φ = 928470574080.
The previous prime is 1053327112309. The next prime is 1053327112363. The reversal of 1053327112321 is 1232117233501.
It is a cyclic number.
It is not a de Polignac number, because 1053327112321 - 25 = 1053327112289 is a prime.
It is a super-2 number, since 2×10533271123212 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1053327112381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 323203990 + ... + 323207248.
It is an arithmetic number, because the mean of its divisors is an integer number (37006982100).
Almost surely, 21053327112321 is an apocalyptic number.
1053327112321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1053327112321 is a deficient number, since it is larger than the sum of its proper divisors (130896314879).
1053327112321 is a wasteful number, since it uses less digits than its factorization.
1053327112321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5809.
The product of its (nonzero) digits is 7560, while the sum is 31.
The spelling of 1053327112321 in words is "one trillion, fifty-three billion, three hundred twenty-seven million, one hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •