Base | Representation |
---|---|
bin | 10011011001101010001… |
… | …110110100110100010101 |
3 | 11201110021112122200011000 |
4 | 103121222032310310111 |
5 | 133320414331224023 |
6 | 2500250201133513 |
7 | 165215326102131 |
oct | 23315216646425 |
9 | 4643245580130 |
10 | 1333222133013 |
11 | 474464156471 |
12 | 19647948a299 |
13 | 98950baa304 |
14 | 487579003c1 |
15 | 24a30870243 |
hex | 1366a3b4d15 |
1333222133013 has 32 divisors (see below), whose sum is σ = 1980565171200. Its totient is φ = 886377085488.
The previous prime is 1333222133003. The next prime is 1333222133027. The reversal of 1333222133013 is 3103312223331.
1333222133013 is a `hidden beast` number, since 1 + 3 + 3 + 322 + 2 + 1 + 330 + 1 + 3 = 666.
It is not a de Polignac number, because 1333222133013 - 24 = 1333222132997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1333222133003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26561206 + ... + 26611352.
It is an arithmetic number, because the mean of its divisors is an integer number (61892661600).
Almost surely, 21333222133013 is an apocalyptic number.
It is an amenable number.
1333222133013 is a deficient number, since it is larger than the sum of its proper divisors (647343038187).
1333222133013 is a wasteful number, since it uses less digits than its factorization.
1333222133013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52838 (or 52832 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 1333222133013 its reverse (3103312223331), we get a palindrome (4436534356344).
The spelling of 1333222133013 in words is "one trillion, three hundred thirty-three billion, two hundred twenty-two million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •