Base | Representation |
---|---|
bin | 10011011000101001110… |
… | …000011011110010010111 |
3 | 11201100111011020011210221 |
4 | 103120221300123302113 |
5 | 133311210422034333 |
6 | 2455551000255211 |
7 | 165146452530421 |
oct | 23305160336227 |
9 | 4640434204727 |
10 | 1332140424343 |
11 | 473a595a4763 |
12 | 196217171507 |
13 | 9880aa62101 |
14 | 48693da3811 |
15 | 249ba8edd2d |
hex | 13629c1bc97 |
1332140424343 has 16 divisors (see below), whose sum is σ = 1392638607360. Its totient is φ = 1272740414400.
The previous prime is 1332140424331. The next prime is 1332140424353. The reversal of 1332140424343 is 3434240412331.
It is not a de Polignac number, because 1332140424343 - 237 = 1194701470871 is a prime.
It is a super-2 number, since 2×13321404243432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332140424299 and 1332140424308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332140424323) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56528283 + ... + 56551843.
It is an arithmetic number, because the mean of its divisors is an integer number (87039912960).
Almost surely, 21332140424343 is an apocalyptic number.
1332140424343 is a deficient number, since it is larger than the sum of its proper divisors (60498183017).
1332140424343 is a wasteful number, since it uses less digits than its factorization.
1332140424343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46758.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 1332140424343 its reverse (3434240412331), we get a palindrome (4766380836674).
The spelling of 1332140424343 in words is "one trillion, three hundred thirty-two billion, one hundred forty million, four hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •