Base | Representation |
---|---|
bin | 10001111011011010001… |
… | …111011100111010011101 |
3 | 11100210001201222212200121 |
4 | 101323122033130322131 |
5 | 130141140131132313 |
6 | 2341552205554541 |
7 | 155003441214421 |
oct | 21733217347235 |
9 | 4323051885617 |
10 | 1232022130333 |
11 | 435552412615 |
12 | 17a935875a51 |
13 | 8c2438a5117 |
14 | 438b734cb81 |
15 | 220ab0e928d |
hex | 11eda3dce9d |
1232022130333 has 8 divisors (see below), whose sum is σ = 1236987325440. Its totient is φ = 1227060016560.
The previous prime is 1232022130303. The next prime is 1232022130349. The reversal of 1232022130333 is 3330312202321.
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 1232022130333 - 229 = 1231485259421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1232022130298 and 1232022130307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1232022130303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32628 + ... + 1570066.
It is an arithmetic number, because the mean of its divisors is an integer number (154623415680).
Almost surely, 21232022130333 is an apocalyptic number.
It is an amenable number.
1232022130333 is a deficient number, since it is larger than the sum of its proper divisors (4965195107).
1232022130333 is a wasteful number, since it uses less digits than its factorization.
1232022130333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1540667.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 1232022130333 its reverse (3330312202321), we get a palindrome (4562334332654).
The spelling of 1232022130333 in words is "one trillion, two hundred thirty-two billion, twenty-two million, one hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •