Base | Representation |
---|---|
bin | 100111101101011… |
… | …0010011000000001 |
3 | 10102212012001120100 |
4 | 1033122302120001 |
5 | 10212100002040 |
6 | 340114233013 |
7 | 45006254445 |
oct | 11732623001 |
9 | 3385161510 |
10 | 1332422145 |
11 | 62413252a |
12 | 312285769 |
13 | 18307a592 |
14 | c8d60825 |
15 | 7be96b30 |
hex | 4f6b2601 |
1332422145 has 12 divisors (see below), whose sum is σ = 2309531796. Its totient is φ = 710625120.
The previous prime is 1332422093. The next prime is 1332422149. The reversal of 1332422145 is 5412242331.
It can be written as a sum of positive squares in 2 ways, for example, as 1052094096 + 280328049 = 32436^2 + 16743^2 .
It is not a de Polignac number, because 1332422145 - 27 = 1332422017 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1332422149) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14804646 + ... + 14804735.
It is an arithmetic number, because the mean of its divisors is an integer number (192460983).
Almost surely, 21332422145 is an apocalyptic number.
1332422145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1332422145 is a deficient number, since it is larger than the sum of its proper divisors (977109651).
1332422145 is a wasteful number, since it uses less digits than its factorization.
1332422145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29609392 (or 29609389 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 1332422145 is about 36502.3580745135. The cubic root of 1332422145 is about 1100.3916360303.
Adding to 1332422145 its reverse (5412242331), we get a palindrome (6744664476).
The spelling of 1332422145 in words is "one billion, three hundred thirty-two million, four hundred twenty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •