Base | Representation |
---|---|
bin | 10011101111111001111… |
… | …111101001010100111001 |
3 | 11210201221020211122012121 |
4 | 103233321333221110321 |
5 | 134213324340044434 |
6 | 2515240333441241 |
7 | 200022265253413 |
oct | 23577177512471 |
9 | 4721836748177 |
10 | 1357108909369 |
11 | 483601666054 |
12 | 19b025040221 |
13 | 9ac898b2bc5 |
14 | 499820a59b3 |
15 | 2547c9487b4 |
hex | 13bf9fe9539 |
1357108909369 has 8 divisors (see below), whose sum is σ = 1363626077760. Its totient is φ = 1350592546800.
The previous prime is 1357108909349. The next prime is 1357108909397. The reversal of 1357108909369 is 9639098017531.
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 1357108909369 - 213 = 1357108901177 is a prime.
It is a super-2 number, since 2×13571089093692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1357108909309) 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, 3322452 + ... + 3708490.
It is an arithmetic number, because the mean of its divisors is an integer number (170453259720).
Almost surely, 21357108909369 is an apocalyptic number.
It is an amenable number.
1357108909369 is a deficient number, since it is larger than the sum of its proper divisors (6517168391).
1357108909369 is a wasteful number, since it uses less digits than its factorization.
1357108909369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402911.
The product of its (nonzero) digits is 11022480, while the sum is 61.
The spelling of 1357108909369 in words is "one trillion, three hundred fifty-seven billion, one hundred eight million, nine hundred nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •