Base | Representation |
---|---|
bin | 10011011011110011111… |
… | …000001001011101010110 |
3 | 11201200020111000211100120 |
4 | 103123303320021131112 |
5 | 133340132022202204 |
6 | 2501311253452410 |
7 | 165326466653313 |
oct | 23336370113526 |
9 | 4650214024316 |
10 | 1335531444054 |
11 | 475439756a95 |
12 | 196a02941106 |
13 | 98c2b462552 |
14 | 488d64b3d0a |
15 | 24b184806d9 |
hex | 136f3e09756 |
1335531444054 has 8 divisors (see below), whose sum is σ = 2671062888120. Its totient is φ = 445177148016.
The previous prime is 1335531443993. The next prime is 1335531444061. The reversal of 1335531444054 is 4504441355331.
It is a sphenic number, since it is the product of 3 distinct primes.
1335531444054 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1335531443997 and 1335531444015.
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 3 ways as a sum of consecutive naturals, for example, 111294286999 + ... + 111294287010.
It is an arithmetic number, because the mean of its divisors is an integer number (333882861015).
Almost surely, 21335531444054 is an apocalyptic number.
1335531444054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1335531444054 is a wasteful number, since it uses less digits than its factorization.
1335531444054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222588574014.
The product of its (nonzero) digits is 864000, while the sum is 42.
Adding to 1335531444054 its reverse (4504441355331), we get a palindrome (5839972799385).
The spelling of 1335531444054 in words is "one trillion, three hundred thirty-five billion, five hundred thirty-one million, four hundred forty-four thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •