Base | Representation |
---|---|
bin | 10000011000000100011… |
… | …010101011110001011111 |
3 | 10222120201221222102111111 |
4 | 100120010122223301133 |
5 | 121414212004113310 |
6 | 2220551534402451 |
7 | 144206234136304 |
oct | 20300432536137 |
9 | 3876657872444 |
10 | 1125355535455 |
11 | 3a4295953078 |
12 | 162127360427 |
13 | 82174b853a8 |
14 | 3c678b5d0ab |
15 | 1e4169a228a |
hex | 106046abc5f |
1125355535455 has 8 divisors (see below), whose sum is σ = 1350812610000. Its totient is φ = 900027116736.
The previous prime is 1125355535449. The next prime is 1125355535503. The reversal of 1125355535455 is 5545355535211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1125355535455 is a prime.
It is a super-3 number, since 3×11253555354553 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1125355535399 and 1125355535408.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 32144710 + ... + 32179699.
It is an arithmetic number, because the mean of its divisors is an integer number (168851576250).
Almost surely, 21125355535455 is an apocalyptic number.
1125355535455 is a deficient number, since it is larger than the sum of its proper divisors (225457074545).
1125355535455 is an equidigital number, since it uses as much as digits as its factorization.
1125355535455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64327913.
The product of its digits is 5625000, while the sum is 49.
The spelling of 1125355535455 in words is "one trillion, one hundred twenty-five billion, three hundred fifty-five million, five hundred thirty-five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •