Base | Representation |
---|---|
bin | 10011101101000011110… |
… | …000001100001000001101 |
3 | 11210110001011121021202011 |
4 | 103231003300030020031 |
5 | 134141044124414201 |
6 | 2514013112501221 |
7 | 166553441014441 |
oct | 23550360141015 |
9 | 4713034537664 |
10 | 1354051404301 |
11 | 482282799262 |
12 | 19a5110aa811 |
13 | 9a8c03161cb |
14 | 49771db0821 |
15 | 2534e2e6151 |
hex | 13b43c0c20d |
1354051404301 has 16 divisors (see below), whose sum is σ = 1419062261760. Its totient is φ = 1289557470960.
The previous prime is 1354051404283. The next prime is 1354051404331. The reversal of 1354051404301 is 1034041504531.
It is a cyclic number.
It is not a de Polignac number, because 1354051404301 - 213 = 1354051396109 is a prime.
It is a super-2 number, since 2×13540514043012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1354051404331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11306506 + ... + 11425636.
It is an arithmetic number, because the mean of its divisors is an integer number (88691391360).
Almost surely, 21354051404301 is an apocalyptic number.
It is an amenable number.
1354051404301 is a deficient number, since it is larger than the sum of its proper divisors (65010857459).
1354051404301 is a wasteful number, since it uses less digits than its factorization.
1354051404301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121296.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 1354051404301 its reverse (1034041504531), we get a palindrome (2388092908832).
The spelling of 1354051404301 in words is "one trillion, three hundred fifty-four billion, fifty-one million, four hundred four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •