Base | Representation |
---|---|
bin | 10011101100010011000… |
… | …110010010000100111011 |
3 | 11210100221021121100120021 |
4 | 103230103012102010323 |
5 | 134132411142043001 |
6 | 2513400112511311 |
7 | 166524266444311 |
oct | 23542306220473 |
9 | 4710837540507 |
10 | 1353235112251 |
11 | 4819a3a3aa30 |
12 | 19a32384b537 |
13 | 9a7c017a869 |
14 | 496d58040b1 |
15 | 25302801ba1 |
hex | 13b1319213b |
1353235112251 has 16 divisors (see below), whose sum is σ = 1522232248320. Its totient is φ = 1192459921120.
The previous prime is 1353235112249. The next prime is 1353235112269. The reversal of 1353235112251 is 1522115323531.
It is a cyclic number.
It is not a de Polignac number, because 1353235112251 - 21 = 1353235112249 is a prime.
It is a super-6 number, since 6×13532351122516 (a number of 74 digits) contains 666666 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1353235112291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13934491 + ... + 14031268.
It is an arithmetic number, because the mean of its divisors is an integer number (95139515520).
Almost surely, 21353235112251 is an apocalyptic number.
1353235112251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1353235112251 is a deficient number, since it is larger than the sum of its proper divisors (168997136069).
1353235112251 is a wasteful number, since it uses less digits than its factorization.
1353235112251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27965906.
The product of its digits is 27000, while the sum is 34.
The spelling of 1353235112251 in words is "one trillion, three hundred fifty-three billion, two hundred thirty-five million, one hundred twelve thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •