Base | Representation |
---|---|
bin | 111101101001001… |
… | …111010001110111 |
3 | 2200002001212001000 |
4 | 331221033101313 |
5 | 4104230030123 |
6 | 250342534343 |
7 | 34425505410 |
oct | 7551172167 |
9 | 2602055030 |
10 | 1034220663 |
11 | 490877323 |
12 | 24a4373b3 |
13 | 13635c2b8 |
14 | 9b4d8807 |
15 | 60be0b43 |
hex | 3da4f477 |
1034220663 has 32 divisors (see below), whose sum is σ = 1753574400. Its totient is φ = 590135328.
The previous prime is 1034220623. The next prime is 1034220683. The reversal of 1034220663 is 3660224301.
It is not a de Polignac number, because 1034220663 - 225 = 1000666231 is a prime.
It is a super-2 number, since 2×10342206632 = 2139224759552319138, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034220623) 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 31 ways as a sum of consecutive naturals, for example, 142558 + ... + 149636.
It is an arithmetic number, because the mean of its divisors is an integer number (54799200).
Almost surely, 21034220663 is an apocalyptic number.
1034220663 is a deficient number, since it is larger than the sum of its proper divisors (719353737).
1034220663 is an equidigital number, since it uses as much as digits as its factorization.
1034220663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7868 (or 7862 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 1034220663 is about 32159.3013450230. The cubic root of 1034220663 is about 1011.2791892434.
Adding to 1034220663 its reverse (3660224301), we get a palindrome (4694444964).
The spelling of 1034220663 in words is "one billion, thirty-four million, two hundred twenty thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •