Base | Representation |
---|---|
bin | 10011000100001110000… |
… | …101110001101001110011 |
3 | 11122020212012010022012110 |
4 | 103010032011301221303 |
5 | 132431243030423103 |
6 | 2441522003300403 |
7 | 163442004215001 |
oct | 23041605615163 |
9 | 4566765108173 |
10 | 1310201420403 |
11 | 4657205aa347 |
12 | 191b1397a703 |
13 | 96722748585 |
14 | 475b237da71 |
15 | 2413481d403 |
hex | 1310e171a73 |
1310201420403 has 8 divisors (see below), whose sum is σ = 1746950246608. Its totient is φ = 873460103904.
The previous prime is 1310201420377. The next prime is 1310201420441. The reversal of 1310201420403 is 3040241020131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1310201420403 - 232 = 1305906453107 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 1310201420403.
It is not an unprimeable number, because it can be changed into a prime (1310201420503) 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 7 ways as a sum of consecutive naturals, for example, 1456876 + ... + 2177817.
It is an arithmetic number, because the mean of its divisors is an integer number (218368780826).
Almost surely, 21310201420403 is an apocalyptic number.
1310201420403 is a deficient number, since it is larger than the sum of its proper divisors (436748826205).
1310201420403 is a wasteful number, since it uses less digits than its factorization.
1310201420403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3754853.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1310201420403 its reverse (3040241020131), we get a palindrome (4350442440534).
The spelling of 1310201420403 in words is "one trillion, three hundred ten billion, two hundred one million, four hundred twenty thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •