Base | Representation |
---|---|
bin | 101001001000110… |
… | …0001010111000011 |
3 | 10120012022202122212 |
4 | 1102101201113003 |
5 | 10311330343203 |
6 | 344545052335 |
7 | 46130365364 |
oct | 12221412703 |
9 | 3505282585 |
10 | 1380324803 |
11 | 649180500 |
12 | 3263270ab |
13 | 18cc80150 |
14 | d146db6b |
15 | 812aa1d8 |
hex | 524615c3 |
1380324803 has 24 divisors (see below), whose sum is σ = 1690323600. Its totient is φ = 1118335680.
The previous prime is 1380324797. The next prime is 1380324823. The reversal of 1380324803 is 3084230831.
It is a happy number.
It is not a de Polignac number, because 1380324803 - 212 = 1380320707 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1380324803.
It is not an unprimeable number, because it can be changed into a prime (1380324823) by changing a digit.
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, 30488 + ... + 60746.
It is an arithmetic number, because the mean of its divisors is an integer number (70430150).
Almost surely, 21380324803 is an apocalyptic number.
1380324803 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1380324803 is a deficient number, since it is larger than the sum of its proper divisors (309998797).
1380324803 is a wasteful number, since it uses less digits than its factorization.
1380324803 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30323 (or 30312 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
The square root of 1380324803 is about 37152.7226862312. The cubic root of 1380324803 is about 1113.4236212788.
The spelling of 1380324803 in words is "one billion, three hundred eighty million, three hundred twenty-four thousand, eight hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •