Base | Representation |
---|---|
bin | 1111110001110010110… |
… | …0001111111100010011 |
3 | 221220122221022020022211 |
4 | 3330130230033330103 |
5 | 13420114430120311 |
6 | 324305240412551 |
7 | 25404140354665 |
oct | 3743454177423 |
9 | 856587266284 |
10 | 271064301331 |
11 | a4a5980564a |
12 | 4464aa77157 |
13 | 1c73b0c8715 |
14 | d1961c2535 |
15 | 70b7218821 |
hex | 3f1cb0ff13 |
271064301331 has 8 divisors (see below), whose sum is σ = 279388376928. Its totient is φ = 262865400000.
The previous prime is 271064301307. The next prime is 271064301337. The reversal of 271064301331 is 133103460172.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 271064301331 - 229 = 270527430419 is a prime.
It is a super-2 number, since 2×2710643013312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 271064301293 and 271064301302.
It is not an unprimeable number, because it can be changed into a prime (271064301337) 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 7 ways as a sum of consecutive naturals, for example, 31289170 + ... + 31297831.
It is an arithmetic number, because the mean of its divisors is an integer number (34923547116).
Almost surely, 2271064301331 is an apocalyptic number.
271064301331 is a deficient number, since it is larger than the sum of its proper divisors (8324075597).
271064301331 is an equidigital number, since it uses as much as digits as its factorization.
271064301331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62587133.
The product of its (nonzero) digits is 9072, while the sum is 31.
The spelling of 271064301331 in words is "two hundred seventy-one billion, sixty-four million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •