Base | Representation |
---|---|
bin | 101000110100110… |
… | …1101010110001111 |
3 | 10112110200112020220 |
4 | 1101221231112033 |
5 | 10301142410033 |
6 | 343533242423 |
7 | 45642566661 |
oct | 12151552617 |
9 | 3473615226 |
10 | 1369888143 |
11 | 6432a2268 |
12 | 322933413 |
13 | 18aa67900 |
14 | cdd14531 |
15 | 803e7bb3 |
hex | 51a6d58f |
1369888143 has 24 divisors (see below), whose sum is σ = 2004974352. Its totient is φ = 831437568.
The previous prime is 1369888139. The next prime is 1369888153. The reversal of 1369888143 is 3418889631.
It is a Cunningham number, because it is equal to 370122-1.
It is not a de Polignac number, because 1369888143 - 22 = 1369888139 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1369888123) 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 23 ways as a sum of consecutive naturals, for example, 18505 + ... + 55517.
It is an arithmetic number, because the mean of its divisors is an integer number (83540598).
Almost surely, 21369888143 is an apocalyptic number.
1369888143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1369888143 is a deficient number, since it is larger than the sum of its proper divisors (635086209).
1369888143 is a wasteful number, since it uses less digits than its factorization.
1369888143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37115 (or 37102 counting only the distinct ones).
The product of its digits is 995328, while the sum is 51.
The square root of 1369888143 is about 37011.9999864909. Note that the first 4 decimals coincide. The cubic root of 1369888143 is about 1110.6103136664.
The spelling of 1369888143 in words is "one billion, three hundred sixty-nine million, eight hundred eighty-eight thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •