Base | Representation |
---|---|
bin | 11110101010001101101… |
… | …00110000101000100111 |
3 | 10201201011002212010110112 |
4 | 33111012310300220213 |
5 | 114224434014121320 |
6 | 2123541201243235 |
7 | 136052413440134 |
oct | 17250664605047 |
9 | 3651132763415 |
10 | 1053455223335 |
11 | 37684a012419 |
12 | 15020003351b |
13 | 78456b280c8 |
14 | 38db79db58b |
15 | 1c609620ec5 |
hex | f546d30a27 |
1053455223335 has 8 divisors (see below), whose sum is σ = 1266391646640. Its totient is φ = 841267259584.
The previous prime is 1053455223263. The next prime is 1053455223361. The reversal of 1053455223335 is 5333225543501.
1053455223335 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1053455223335 - 224 = 1053438446119 is a prime.
It is a super-2 number, since 2×10534552233352 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1053455223292 and 1053455223301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187111790 + ... + 187117419.
It is an arithmetic number, because the mean of its divisors is an integer number (158298955830).
Almost surely, 21053455223335 is an apocalyptic number.
1053455223335 is a deficient number, since it is larger than the sum of its proper divisors (212936423305).
1053455223335 is an equidigital number, since it uses as much as digits as its factorization.
1053455223335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374229777.
The product of its (nonzero) digits is 810000, while the sum is 41.
The spelling of 1053455223335 in words is "one trillion, fifty-three billion, four hundred fifty-five million, two hundred twenty-three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •