Base | Representation |
---|---|
bin | 10011000010101001… |
… | …10001000100001011 |
3 | 222101102221102220200 |
4 | 21201110301010023 |
5 | 131414012042040 |
6 | 4410221223243 |
7 | 511221045330 |
oct | 114124610413 |
9 | 28342842820 |
10 | 10222768395 |
11 | 4376539224 |
12 | 1b93701b23 |
13 | c6bbb6ca8 |
14 | 6cd990987 |
15 | 3ec713630 |
hex | 26153110b |
10222768395 has 48 divisors (see below), whose sum is σ = 20949140160. Its totient is φ = 4512114432.
The previous prime is 10222768331. The next prime is 10222768427. The reversal of 10222768395 is 59386722201.
It is not a de Polignac number, because 10222768395 - 26 = 10222768331 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 10222768395.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 550404 + ... + 568673.
It is an arithmetic number, because the mean of its divisors is an integer number (436440420).
Almost surely, 210222768395 is an apocalyptic number.
10222768395 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10222768395 is an abundant number, since it is smaller than the sum of its proper divisors (10726371765).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10222768395 is a wasteful number, since it uses less digits than its factorization.
10222768395 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119124 (or 1119121 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 10222768395 in words is "ten billion, two hundred twenty-two million, seven hundred sixty-eight thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •