Base | Representation |
---|---|
bin | 10011011001101010001… |
… | …111001010010101000010 |
3 | 11201110021112211011000022 |
4 | 103121222033022111002 |
5 | 133320414342033442 |
6 | 2500250203053442 |
7 | 165215326620041 |
oct | 23315217122502 |
9 | 4643245734008 |
10 | 1333222221122 |
11 | 474464206690 |
12 | 196479511282 |
13 | 98950c0b44c |
14 | 48757924558 |
15 | 24a3088b3d2 |
hex | 1366a3ca542 |
1333222221122 has 8 divisors (see below), whose sum is σ = 2181636361872. Its totient is φ = 606010100500.
The previous prime is 1333222221103. The next prime is 1333222221127. The reversal of 1333222221122 is 2211222223331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×13332222211223 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1333222221091 and 1333222221100.
It is not an unprimeable number, because it can be changed into a prime (1333222221127) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 30300505004 + ... + 30300505047.
It is an arithmetic number, because the mean of its divisors is an integer number (272704545234).
Almost surely, 21333222221122 is an apocalyptic number.
1333222221122 is a deficient number, since it is larger than the sum of its proper divisors (848414140750).
1333222221122 is a wasteful number, since it uses less digits than its factorization.
1333222221122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60601010064.
The product of its digits is 3456, while the sum is 26.
Adding to 1333222221122 its reverse (2211222223331), we get a palindrome (3544444444453).
The spelling of 1333222221122 in words is "one trillion, three hundred thirty-three billion, two hundred twenty-two million, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •