Base | Representation |
---|---|
bin | 100111000011001… |
… | …1111111010011110 |
3 | 10101022121110221112 |
4 | 1032012133322132 |
5 | 10140420421210 |
6 | 334004502022 |
7 | 44320406450 |
oct | 11606377236 |
9 | 3338543845 |
10 | 1310326430 |
11 | 612710706 |
12 | 3069aa912 |
13 | 17b6122aa |
14 | c604c2d0 |
15 | 7a07ed05 |
hex | 4e19fe9e |
1310326430 has 32 divisors (see below), whose sum is σ = 2788482240. Its totient is φ = 433762560.
The previous prime is 1310326403. The next prime is 1310326439. The reversal of 1310326430 is 346230131.
It is a junction number, because it is equal to n+sod(n) for n = 1310326396 and 1310326405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310326439) by changing a digit.
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, 320711 + ... + 324770.
It is an arithmetic number, because the mean of its divisors is an integer number (87140070).
Almost surely, 21310326430 is an apocalyptic number.
1310326430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1310326430 is an abundant number, since it is smaller than the sum of its proper divisors (1478155810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1310326430 is a wasteful number, since it uses less digits than its factorization.
1310326430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645524.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 1310326430 is about 36198.4313196028. The cubic root of 1310326430 is about 1094.2750579231.
Adding to 1310326430 its reverse (346230131), we get a palindrome (1656556561).
The spelling of 1310326430 in words is "one billion, three hundred ten million, three hundred twenty-six thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •