Base | Representation |
---|---|
bin | 100111011111011… |
… | …0111100110010001 |
3 | 10102100102020021121 |
4 | 1032332313212101 |
5 | 10203211303010 |
6 | 335253322241 |
7 | 44560123345 |
oct | 11676674621 |
9 | 3370366247 |
10 | 1325103505 |
11 | 61aa93970 |
12 | 30b936381 |
13 | 1816b731b |
14 | c7db7625 |
15 | 7b4ed3da |
hex | 4efb7991 |
1325103505 has 16 divisors (see below), whose sum is σ = 1836722304. Its totient is φ = 907022080.
The previous prime is 1325103499. The next prime is 1325103511. The reversal of 1325103505 is 5053015231.
It is an interprime number because it is at equal distance from previous prime (1325103499) and next prime (1325103511).
It is not a de Polignac number, because 1325103505 - 23 = 1325103497 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 1325103505.
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 15 ways as a sum of consecutive naturals, for example, 707677 + ... + 709546.
It is an arithmetic number, because the mean of its divisors is an integer number (114795144).
Almost surely, 21325103505 is an apocalyptic number.
It is an amenable number.
1325103505 is a deficient number, since it is larger than the sum of its proper divisors (511618799).
1325103505 is a wasteful number, since it uses less digits than its factorization.
1325103505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1417256.
The product of its (nonzero) digits is 2250, while the sum is 25.
The square root of 1325103505 is about 36401.9711691551. The cubic root of 1325103505 is about 1098.3732165578.
Adding to 1325103505 its reverse (5053015231), we get a palindrome (6378118736).
The spelling of 1325103505 in words is "one billion, three hundred twenty-five million, one hundred three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •