Base | Representation |
---|---|
bin | 100111000011011… |
… | …0010101101001001 |
3 | 10101022202101112022 |
4 | 1032012302231021 |
5 | 10140430402101 |
6 | 334010254225 |
7 | 44321150036 |
oct | 11606625511 |
9 | 3338671468 |
10 | 1310403401 |
11 | 61276351a |
12 | 306a27375 |
13 | 17b63b338 |
14 | c606c38d |
15 | 7a097a1b |
hex | 4e1b2b49 |
1310403401 has 8 divisors (see below), whose sum is σ = 1390465440. Its totient is φ = 1230672448.
The previous prime is 1310403397. The next prime is 1310403431. The reversal of 1310403401 is 1043040131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1310403401 - 22 = 1310403397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
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 1310403401.
It is not an unprimeable number, because it can be changed into a prime (1310403431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74591 + ... + 90468.
It is an arithmetic number, because the mean of its divisors is an integer number (173808180).
Almost surely, 21310403401 is an apocalyptic number.
It is an amenable number.
1310403401 is a deficient number, since it is larger than the sum of its proper divisors (80062039).
1310403401 is a wasteful number, since it uses less digits than its factorization.
1310403401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165543.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1310403401 is about 36199.4944854206. The cubic root of 1310403401 is about 1094.2964840844.
Adding to 1310403401 its reverse (1043040131), we get a palindrome (2353443532).
The spelling of 1310403401 in words is "one billion, three hundred ten million, four hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •