Base | Representation |
---|---|
bin | 10011011000110101001… |
… | …011010010010111011111 |
3 | 11201100222111201220001222 |
4 | 103120311023102113133 |
5 | 133312103443404043 |
6 | 2500022002523555 |
7 | 165154300153124 |
oct | 23306513222737 |
9 | 4640874656058 |
10 | 1332332013023 |
11 | 474047762110 |
12 | 19626b3665bb |
13 | 9883b6629ab |
14 | 486b15d674b |
15 | 249cc645d68 |
hex | 136352d25df |
1332332013023 has 16 divisors (see below), whose sum is σ = 1500617029632. Its totient is φ = 1171922148000.
The previous prime is 1332332012971. The next prime is 1332332013079. The reversal of 1332332013023 is 3203102332331.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1332332013023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332332012983 and 1332332013001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332332013223) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1492265 + ... + 2211677.
It is an arithmetic number, because the mean of its divisors is an integer number (93788564352).
Almost surely, 21332332013023 is an apocalyptic number.
1332332013023 is a deficient number, since it is larger than the sum of its proper divisors (168285016609).
1332332013023 is a wasteful number, since it uses less digits than its factorization.
1332332013023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724886.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 1332332013023 its reverse (3203102332331), we get a palindrome (4535434345354).
The spelling of 1332332013023 in words is "one trillion, three hundred thirty-two billion, three hundred thirty-two million, thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •