Base | Representation |
---|---|
bin | 10011000100011001111… |
… | …111010011011011110001 |
3 | 11122021101002202120000022 |
4 | 103010121333103123301 |
5 | 132432200132102403 |
6 | 2441553454133225 |
7 | 163446650101343 |
oct | 23043177233361 |
9 | 4567332676008 |
10 | 1310401050353 |
11 | 46581325a27a |
12 | 191b6a7b1215 |
13 | 96754c032c5 |
14 | 475d0aa7293 |
15 | 24147102d38 |
hex | 13119fd36f1 |
1310401050353 has 4 divisors (see below), whose sum is σ = 1367375009088. Its totient is φ = 1253427091620.
The previous prime is 1310401050349. The next prime is 1310401050367. The reversal of 1310401050353 is 3530501040131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1310401050353 - 22 = 1310401050349 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310401050953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28486979333 + ... + 28486979378.
It is an arithmetic number, because the mean of its divisors is an integer number (341843752272).
Almost surely, 21310401050353 is an apocalyptic number.
It is an amenable number.
1310401050353 is a deficient number, since it is larger than the sum of its proper divisors (56973958735).
1310401050353 is an equidigital number, since it uses as much as digits as its factorization.
1310401050353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56973958734.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 1310401050353 its reverse (3530501040131), we get a palindrome (4840902090484).
The spelling of 1310401050353 in words is "one trillion, three hundred ten billion, four hundred one million, fifty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •