Base | Representation |
---|---|
bin | 10011101111111001… |
… | …10100000110111000 |
3 | 1000100220012222001211 |
4 | 21313330310012320 |
5 | 133203201142433 |
6 | 4512021252504 |
7 | 523510422130 |
oct | 116774640670 |
9 | 30326188054 |
10 | 10602365368 |
11 | 4550839031 |
12 | 207a864134 |
13 | ccc73389a |
14 | 728163ac0 |
15 | 420be68cd |
hex | 277f341b8 |
10602365368 has 16 divisors (see below), whose sum is σ = 22719354480. Its totient is φ = 4543870848.
The previous prime is 10602365329. The next prime is 10602365369. The reversal of 10602365368 is 86356320601.
It is a super-2 number, since 2×106023653682 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10602365368.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10602365369) 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 3 ways as a sum of consecutive naturals, for example, 94663921 + ... + 94664032.
It is an arithmetic number, because the mean of its divisors is an integer number (1419959655).
Almost surely, 210602365368 is an apocalyptic number.
It is an amenable number.
10602365368 is an abundant number, since it is smaller than the sum of its proper divisors (12116989112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10602365368 is a wasteful number, since it uses less digits than its factorization.
10602365368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189327966 (or 189327962 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 40.
Adding to 10602365368 its reverse (86356320601), we get a palindrome (96958685969).
The spelling of 10602365368 in words is "ten billion, six hundred two million, three hundred sixty-five thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •