Base | Representation |
---|---|
bin | 10011101110010111011… |
… | …000011011100010101101 |
3 | 11210120122221201000020202 |
4 | 103232113120123202231 |
5 | 134201432320242000 |
6 | 2514404233123245 |
7 | 166633265554151 |
oct | 23562730334255 |
9 | 4716587630222 |
10 | 1355454462125 |
11 | 482932786385 |
12 | 19a842b59525 |
13 | 9aa84bc573a |
14 | 4986647b061 |
15 | 253d2591dd5 |
hex | 13b9761b8ad |
1355454462125 has 16 divisors (see below), whose sum is σ = 1698867321840. Its totient is φ = 1079709625600.
The previous prime is 1355454462053. The next prime is 1355454462139. The reversal of 1355454462125 is 5212644545531.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 258646496329 + 1096807965796 = 508573^2 + 1047286^2 .
It is not a de Polignac number, because 1355454462125 - 240 = 255942834349 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1355454462125.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23240480 + ... + 23298729.
It is an arithmetic number, because the mean of its divisors is an integer number (106179207615).
Almost surely, 21355454462125 is an apocalyptic number.
It is an amenable number.
1355454462125 is a deficient number, since it is larger than the sum of its proper divisors (343412859715).
1355454462125 is an equidigital number, since it uses as much as digits as its factorization.
1355454462125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46539457 (or 46539447 counting only the distinct ones).
The product of its digits is 2880000, while the sum is 47.
The spelling of 1355454462125 in words is "one trillion, three hundred fifty-five billion, four hundred fifty-four million, four hundred sixty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •