Base | Representation |
---|---|
bin | 101000010001011… |
… | …1110101001110001 |
3 | 10111011210112022112 |
4 | 1100202332221301 |
5 | 10231421044201 |
6 | 342032015105 |
7 | 45326154410 |
oct | 12042765161 |
9 | 3434715275 |
10 | 1351346801 |
11 | 633888942 |
12 | 318691495 |
13 | 186c753bc |
14 | cb689477 |
15 | 7d9840bb |
hex | 508bea71 |
1351346801 has 4 divisors (see below), whose sum is σ = 1544396352. Its totient is φ = 1158297252.
The previous prime is 1351346749. The next prime is 1351346803. The reversal of 1351346801 is 1086431531.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1086431531 = 701 ⋅1549831.
It is not a de Polignac number, because 1351346801 - 210 = 1351345777 is a prime.
It is a super-2 number, since 2×13513468012 = 3652276353145867202, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1351346803) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96524765 + ... + 96524778.
It is an arithmetic number, because the mean of its divisors is an integer number (386099088).
Almost surely, 21351346801 is an apocalyptic number.
It is an amenable number.
1351346801 is a deficient number, since it is larger than the sum of its proper divisors (193049551).
1351346801 is an equidigital number, since it uses as much as digits as its factorization.
1351346801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193049550.
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 1351346801 is about 36760.6692131686. The cubic root of 1351346801 is about 1105.5768576109.
The spelling of 1351346801 in words is "one billion, three hundred fifty-one million, three hundred forty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •