Base | Representation |
---|---|
bin | 10011111100011001… |
… | …10011101110000101 |
3 | 1000122012112012110212 |
4 | 21332030303232011 |
5 | 133412022041011 |
6 | 4530244525205 |
7 | 526222610603 |
oct | 117614635605 |
9 | 30565465425 |
10 | 10707221381 |
11 | 45a4a4699a |
12 | 20a99b0805 |
13 | 101838776c |
14 | 73805a873 |
15 | 42a00a08b |
hex | 27e333b85 |
10707221381 has 8 divisors (see below), whose sum is σ = 10974746328. Its totient is φ = 10440000000.
The previous prime is 10707221363. The next prime is 10707221429. The reversal of 10707221381 is 18312270701.
It can be written as a sum of positive squares in 4 ways, for example, as 1218708100 + 9488513281 = 34910^2 + 97409^2 .
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 10707221381 - 222 = 10703027077 is a prime.
It is a super-2 number, since 2×107072213812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10707221351) 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 7 ways as a sum of consecutive naturals, for example, 3620 + ... + 146381.
It is an arithmetic number, because the mean of its divisors is an integer number (1371843291).
Almost surely, 210707221381 is an apocalyptic number.
It is an amenable number.
10707221381 is a deficient number, since it is larger than the sum of its proper divisors (267524947).
10707221381 is a wasteful number, since it uses less digits than its factorization.
10707221381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151783.
The product of its (nonzero) digits is 4704, while the sum is 32.
The spelling of 10707221381 in words is "ten billion, seven hundred seven million, two hundred twenty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •