Base | Representation |
---|---|
bin | 10100001101011000000… |
… | …010000111101111111000 |
3 | 11220202121110202002012021 |
4 | 110031120002013233320 |
5 | 140223130323401030 |
6 | 2541552241524224 |
7 | 202222361011561 |
oct | 24153002075770 |
9 | 4822543662167 |
10 | 1388751387640 |
11 | 495a69a54341 |
12 | 1a5196043674 |
13 | a0c60334626 |
14 | 4b304701168 |
15 | 261d086297a |
hex | 14358087bf8 |
1388751387640 has 32 divisors (see below), whose sum is σ = 3128953567680. Its totient is φ = 554742698112.
The previous prime is 1388751387623. The next prime is 1388751387677. The reversal of 1388751387640 is 467831578831.
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 23653344 + ... + 23711983.
It is an arithmetic number, because the mean of its divisors is an integer number (97779798990).
Almost surely, 21388751387640 is an apocalyptic number.
1388751387640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1388751387640 is an abundant number, since it is smaller than the sum of its proper divisors (1740202180040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1388751387640 is a wasteful number, since it uses less digits than its factorization.
1388751387640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47366071 (or 47366067 counting only the distinct ones).
The product of its (nonzero) digits is 27095040, while the sum is 61.
The spelling of 1388751387640 in words is "one trillion, three hundred eighty-eight billion, seven hundred fifty-one million, three hundred eighty-seven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •