Base | Representation |
---|---|
bin | 10011011000000011… |
… | …11000101000111111 |
3 | 222211221220001100020 |
4 | 21230001320220333 |
5 | 132301001234223 |
6 | 4440114503223 |
7 | 515531445453 |
oct | 115401705077 |
9 | 28757801306 |
10 | 10402368063 |
11 | 44589580aa |
12 | 2023894b13 |
13 | c9a17a899 |
14 | 709782663 |
15 | 40d38d1e3 |
hex | 26c078a3f |
10402368063 has 16 divisors (see below), whose sum is σ = 14352595680. Its totient is φ = 6693676416.
The previous prime is 10402368061. The next prime is 10402368077. The reversal of 10402368063 is 36086320401.
10402368063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 1019922-1.
It is not a de Polignac number, because 10402368063 - 21 = 10402368061 is a prime.
It is a super-2 number, since 2×104023680632 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10402368061) 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 15 ways as a sum of consecutive naturals, for example, 288981 + ... + 322977.
It is an arithmetic number, because the mean of its divisors is an integer number (897037230).
Almost surely, 210402368063 is an apocalyptic number.
10402368063 is a deficient number, since it is larger than the sum of its proper divisors (3950227617).
10402368063 is a wasteful number, since it uses less digits than its factorization.
10402368063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37546.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 10402368063 its reverse (36086320401), we get a palindrome (46488688464).
The spelling of 10402368063 in words is "ten billion, four hundred two million, three hundred sixty-eight thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •