Base | Representation |
---|---|
bin | 11111100101110101011… |
… | …11011111001011110111 |
3 | 10211202202220110112121220 |
4 | 33302322233133023313 |
5 | 120241012440104041 |
6 | 2150353341041423 |
7 | 141264554206401 |
oct | 17627257371367 |
9 | 3752686415556 |
10 | 1085464769271 |
11 | 389385623013 |
12 | 156453b56273 |
13 | 7b48862a52c |
14 | 3a772ca7b71 |
15 | 1d37e895d66 |
hex | fcbabdf2f7 |
1085464769271 has 8 divisors (see below), whose sum is σ = 1448983063920. Its totient is φ = 722794827072.
The previous prime is 1085464769239. The next prime is 1085464769287. The reversal of 1085464769271 is 1729674645801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1085464769271 - 25 = 1085464769239 is a prime.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1085464769971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 212085126 + ... + 212090243.
It is an arithmetic number, because the mean of its divisors is an integer number (181122882990).
Almost surely, 21085464769271 is an apocalyptic number.
1085464769271 is a deficient number, since it is larger than the sum of its proper divisors (363518294649).
1085464769271 is an equidigital number, since it uses as much as digits as its factorization.
1085464769271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424176225.
The product of its (nonzero) digits is 20321280, while the sum is 60.
The spelling of 1085464769271 in words is "one trillion, eighty-five billion, four hundred sixty-four million, seven hundred sixty-nine thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •