Base | Representation |
---|---|
bin | 10011000010100100… |
… | …01010111000000001 |
3 | 222101101122212011001 |
4 | 21201102022320001 |
5 | 131413323301211 |
6 | 4410154452001 |
7 | 511212211621 |
oct | 114122127001 |
9 | 28341585131 |
10 | 10222087681 |
11 | 4376113853 |
12 | 1b93434001 |
13 | c6ba091c0 |
14 | 6cd854881 |
15 | 3ec62bac1 |
hex | 26148ae01 |
10222087681 has 8 divisors (see below), whose sum is σ = 11015068904. Its totient is φ = 9430058880.
The previous prime is 10222087679. The next prime is 10222087697. The reversal of 10222087681 is 18678022201.
It can be written as a sum of positive squares in 4 ways, for example, as 431974656 + 9790113025 = 20784^2 + 98945^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 10222087681 - 21 = 10222087679 is a prime.
It is a super-2 number, since 2×102220876812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10222087681.
It is not an unprimeable number, because it can be changed into a prime (10222087081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 215730 + ... + 258811.
It is an arithmetic number, because the mean of its divisors is an integer number (1376883613).
Almost surely, 210222087681 is an apocalyptic number.
It is an amenable number.
10222087681 is a deficient number, since it is larger than the sum of its proper divisors (792981223).
10222087681 is a wasteful number, since it uses less digits than its factorization.
10222087681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 476211.
The product of its (nonzero) digits is 21504, while the sum is 37.
The spelling of 10222087681 in words is "ten billion, two hundred twenty-two million, eighty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •