Base | Representation |
---|---|
bin | 1000110100100110… |
… | …1010011100111110 |
3 | 20010001000222210210 |
4 | 2031021222130332 |
5 | 14322214330023 |
6 | 1030553013250 |
7 | 112453456542 |
oct | 21511523476 |
9 | 6101028723 |
10 | 2368120638 |
11 | 10058190a4 |
12 | 5610b4226 |
13 | 2b9806420 |
14 | 186721a22 |
15 | dcd7a593 |
hex | 8d26a73e |
2368120638 has 32 divisors (see below), whose sum is σ = 5400603936. Its totient is φ = 685790208.
The previous prime is 2368120637. The next prime is 2368120661. The reversal of 2368120638 is 8360218632.
It is a super-2 number, since 2×23681206382 = 11215990712243054088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 2368120596 and 2368120605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2368120631) 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, 891631 + ... + 894282.
It is an arithmetic number, because the mean of its divisors is an integer number (168768873).
Almost surely, 22368120638 is an apocalyptic number.
2368120638 is an abundant number, since it is smaller than the sum of its proper divisors (3032483298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2368120638 is a wasteful number, since it uses less digits than its factorization.
2368120638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1785948.
The product of its (nonzero) digits is 82944, while the sum is 39.
The square root of 2368120638 is about 48663.3397744133. The cubic root of 2368120638 is about 1332.9113749913.
The spelling of 2368120638 in words is "two billion, three hundred sixty-eight million, one hundred twenty thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •