Base | Representation |
---|---|
bin | 10011101100011111000… |
… | …010111001111001000101 |
3 | 11210101110020202211001122 |
4 | 103230133002321321011 |
5 | 134133314000201344 |
6 | 2513432033003325 |
7 | 166532252246555 |
oct | 23543702717105 |
9 | 4711406684048 |
10 | 1353435553349 |
11 | 481a970a4330 |
12 | 19a37a9b3545 |
13 | 9a82285a869 |
14 | 4971429d165 |
15 | 253151e6aee |
hex | 13b1f0b9e45 |
1353435553349 has 8 divisors (see below), whose sum is σ = 1498512092448. Its totient is φ = 1212031838160.
The previous prime is 1353435553331. The next prime is 1353435553381. The reversal of 1353435553349 is 9433555343531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1353435553349 is a prime.
It is a super-2 number, since 2×13534355533492 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1353435553349.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1353435553949) 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, 918205202 + ... + 918206675.
It is an arithmetic number, because the mean of its divisors is an integer number (187314011556).
Almost surely, 21353435553349 is an apocalyptic number.
It is an amenable number.
1353435553349 is a deficient number, since it is larger than the sum of its proper divisors (145076539099).
1353435553349 is a wasteful number, since it uses less digits than its factorization.
1353435553349 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1836411955.
The product of its digits is 21870000, while the sum is 53.
The spelling of 1353435553349 in words is "one trillion, three hundred fifty-three billion, four hundred thirty-five million, five hundred fifty-three thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •