Base | Representation |
---|---|
bin | 10011001000011001… |
… | …11000010110001001 |
3 | 222111210202112010000 |
4 | 21210030320112021 |
5 | 132013341021323 |
6 | 4415103513213 |
7 | 512345223534 |
oct | 114414702611 |
9 | 28453675100 |
10 | 10271032713 |
11 | 43a0803997 |
12 | 1ba78b8809 |
13 | c78bb5366 |
14 | 6d6155a1b |
15 | 401a98e43 |
hex | 264338589 |
10271032713 has 60 divisors (see below), whose sum is σ = 15842206204. Its totient is φ = 6631372800.
The previous prime is 10271032691. The next prime is 10271032753. The reversal of 10271032713 is 31723017201.
10271032713 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 5128421769 + 5142610944 = 71613^2 + 71712^2 .
It is not a de Polignac number, because 10271032713 - 210 = 10271031689 is a prime.
It is a super-2 number, since 2×102710327132 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10271032753) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 32814645 + ... + 32814957.
Almost surely, 210271032713 is an apocalyptic number.
It is an amenable number.
10271032713 is a deficient number, since it is larger than the sum of its proper divisors (5571173491).
10271032713 is an equidigital number, since it uses as much as digits as its factorization.
10271032713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 648 (or 598 counting only the distinct ones).
The product of its (nonzero) digits is 1764, while the sum is 27.
Adding to 10271032713 its reverse (31723017201), we get a palindrome (41994049914).
The spelling of 10271032713 in words is "ten billion, two hundred seventy-one million, thirty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •