Base | Representation |
---|---|
bin | 10011000010100101… |
… | …10011000110011111 |
3 | 222101101222020011111 |
4 | 21201102303012133 |
5 | 131413344034242 |
6 | 4410202202451 |
7 | 511213466161 |
oct | 114122630637 |
9 | 28341866144 |
10 | 10222252447 |
11 | 4376216620 |
12 | 1b934b3427 |
13 | c6ba661b4 |
14 | 6cd898931 |
15 | 3ec660817 |
hex | 2614b319f |
10222252447 has 4 divisors (see below), whose sum is σ = 11151548136. Its totient is φ = 9292956760.
The previous prime is 10222252399. The next prime is 10222252493. The reversal of 10222252447 is 74425222201.
10222252447 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10222252447 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222222447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 464647828 + ... + 464647849.
It is an arithmetic number, because the mean of its divisors is an integer number (2787887034).
Almost surely, 210222252447 is an apocalyptic number.
10222252447 is a deficient number, since it is larger than the sum of its proper divisors (929295689).
10222252447 is an equidigital number, since it uses as much as digits as its factorization.
10222252447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929295688.
The product of its (nonzero) digits is 17920, while the sum is 31.
Adding to 10222252447 its reverse (74425222201), we get a palindrome (84647474648).
The spelling of 10222252447 in words is "ten billion, two hundred twenty-two million, two hundred fifty-two thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •