Base | Representation |
---|---|
bin | 10011011011100000001… |
… | …000010111011010111001 |
3 | 11201122101101122102000210 |
4 | 103123200020113122321 |
5 | 133333442214314400 |
6 | 2501214341021333 |
7 | 165315335012103 |
oct | 23334010273271 |
9 | 4648341572023 |
10 | 1335200151225 |
11 | 475289749866 |
12 | 19692b9b4849 |
13 | 98ba79291a5 |
14 | 488a44b6573 |
15 | 24ae933e950 |
hex | 136e02176b9 |
1335200151225 has 24 divisors (see below), whose sum is σ = 2283652676160. Its totient is φ = 687551341120.
The previous prime is 1335200151221. The next prime is 1335200151281. The reversal of 1335200151225 is 5221510025331.
It is not a de Polignac number, because 1335200151225 - 22 = 1335200151221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1335200151192 and 1335200151201.
It is not an unprimeable number, because it can be changed into a prime (1335200151221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 306940389 + ... + 306944738.
It is an arithmetic number, because the mean of its divisors is an integer number (95152194840).
Almost surely, 21335200151225 is an apocalyptic number.
1335200151225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1335200151225 is a deficient number, since it is larger than the sum of its proper divisors (948452524935).
1335200151225 is a wasteful number, since it uses less digits than its factorization.
1335200151225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 613885169 (or 613885164 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 1335200151225 its reverse (5221510025331), we get a palindrome (6556710176556).
The spelling of 1335200151225 in words is "one trillion, three hundred thirty-five billion, two hundred million, one hundred fifty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •