Base | Representation |
---|---|
bin | 10011011000110000100… |
… | …011001111001001110001 |
3 | 11201100210002201000012101 |
4 | 103120300203033021301 |
5 | 133311424111431413 |
6 | 2500010151300401 |
7 | 165152335412263 |
oct | 23306043171161 |
9 | 4640702630171 |
10 | 1332254405233 |
11 | 474007975244 |
12 | 19624937a701 |
13 | 9882855c41b |
14 | 486a5193b33 |
15 | 249c5915edd |
hex | 136308cf271 |
1332254405233 has 16 divisors (see below), whose sum is σ = 1451169316800. Its totient is φ = 1218245434560.
The previous prime is 1332254405221. The next prime is 1332254405243. The reversal of 1332254405233 is 3325044522331.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332254405233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332254405192 and 1332254405201.
It is not an unprimeable number, because it can be changed into a prime (1332254405243) 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 15 ways as a sum of consecutive naturals, for example, 1467163 + ... + 2194783.
It is an arithmetic number, because the mean of its divisors is an integer number (90698082300).
Almost surely, 21332254405233 is an apocalyptic number.
It is an amenable number.
1332254405233 is a deficient number, since it is larger than the sum of its proper divisors (118914911567).
1332254405233 is a wasteful number, since it uses less digits than its factorization.
1332254405233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730992.
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 1332254405233 its reverse (3325044522331), we get a palindrome (4657298927564).
The spelling of 1332254405233 in words is "one trillion, three hundred thirty-two billion, two hundred fifty-four million, four hundred five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •