Base | Representation |
---|---|
bin | 101000110100100… |
… | …0100001101010110 |
3 | 10112110100222002222 |
4 | 1101221010031112 |
5 | 10301122012023 |
6 | 343525502342 |
7 | 45641265500 |
oct | 12151041526 |
9 | 3473328088 |
10 | 1369719638 |
11 | 643197701 |
12 | 3228719b2 |
13 | 18aa08cc1 |
14 | cdcacd70 |
15 | 803b2cc8 |
hex | 51a44356 |
1369719638 has 48 divisors (see below), whose sum is σ = 2426941440. Its totient is φ = 578034576.
The previous prime is 1369719629. The next prime is 1369719643. The reversal of 1369719638 is 8369179631.
It is a happy number.
It is a super-2 number, since 2×13697196382 = 3752263773445702088, which contains 22 as substring.
It is a hoax number, since the sum of its digits (53) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1369719638.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2078153 + ... + 2078811.
It is an arithmetic number, because the mean of its divisors is an integer number (50561280).
Almost surely, 21369719638 is an apocalyptic number.
1369719638 is a deficient number, since it is larger than the sum of its proper divisors (1057221802).
1369719638 is a wasteful number, since it uses less digits than its factorization.
1369719638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 969 (or 962 counting only the distinct ones).
The product of its digits is 1469664, while the sum is 53.
The square root of 1369719638 is about 37009.7235601673. The cubic root of 1369719638 is about 1110.5647744094.
The spelling of 1369719638 in words is "one billion, three hundred sixty-nine million, seven hundred nineteen thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •