Base | Representation |
---|---|
bin | 101000010110100… |
… | …1001101001110101 |
3 | 10111100211000001210 |
4 | 1100231021221311 |
5 | 10233111411201 |
6 | 342205112033 |
7 | 45360631434 |
oct | 12055115165 |
9 | 3440730053 |
10 | 1354013301 |
11 | 63533a263 |
12 | 319558619 |
13 | 18769a004 |
14 | cbb8111b |
15 | 7dd0e1d6 |
hex | 50b49a75 |
1354013301 has 4 divisors (see below), whose sum is σ = 1805351072. Its totient is φ = 902675532.
The previous prime is 1354013299. The next prime is 1354013327. The reversal of 1354013301 is 1033104531.
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 not a de Polignac number, because 1354013301 - 21 = 1354013299 is a prime.
It is a super-4 number, since 4×13540133014 (a number of 38 digits) contains 4444 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1354013351) 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, 225668881 + ... + 225668886.
It is an arithmetic number, because the mean of its divisors is an integer number (451337768).
Almost surely, 21354013301 is an apocalyptic number.
It is an amenable number.
1354013301 is a deficient number, since it is larger than the sum of its proper divisors (451337771).
1354013301 is an equidigital number, since it uses as much as digits as its factorization.
1354013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451337770.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 1354013301 is about 36796.9197216289. The cubic root of 1354013301 is about 1106.3035607251.
Adding to 1354013301 its reverse (1033104531), we get a palindrome (2387117832).
The spelling of 1354013301 in words is "one billion, three hundred fifty-four million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •