Base | Representation |
---|---|
bin | 10010101011111101… |
… | …01001010011100001 |
3 | 221220011202202002112 |
4 | 21111332221103201 |
5 | 131021244420230 |
6 | 4335301325105 |
7 | 503420110043 |
oct | 112576512341 |
9 | 27804682075 |
10 | 10032420065 |
11 | 4289048758 |
12 | 1b3ba06795 |
13 | c3b62bb45 |
14 | 6b25a1a93 |
15 | 3dab63d95 |
hex | 255fa94e1 |
10032420065 has 4 divisors (see below), whose sum is σ = 12038904084. Its totient is φ = 8025936048.
The previous prime is 10032420049. The next prime is 10032420077. The reversal of 10032420065 is 56002423001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4378733584 + 5653686481 = 66172^2 + 75191^2 .
It is a cyclic number.
It is not a de Polignac number, because 10032420065 - 24 = 10032420049 is a prime.
It is a super-2 number, since 2×100324200652 (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 10032420065.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1003242002 + ... + 1003242011.
It is an arithmetic number, because the mean of its divisors is an integer number (3009726021).
Almost surely, 210032420065 is an apocalyptic number.
It is an amenable number.
10032420065 is a deficient number, since it is larger than the sum of its proper divisors (2006484019).
10032420065 is an equidigital number, since it uses as much as digits as its factorization.
10032420065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2006484018.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 10032420065 its reverse (56002423001), we get a palindrome (66034843066).
The spelling of 10032420065 in words is "ten billion, thirty-two million, four hundred twenty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •