Base | Representation |
---|---|
bin | 100101110010111011100100… |
… | …0110000001001110011011001 |
3 | 1121121010102021021121122100202 |
4 | 1023211313020300021303121 |
5 | 322033421434233110040 |
6 | 3135023510044311545 |
7 | 130012050354423620 |
oct | 11345671060116331 |
9 | 1547112237548322 |
10 | 332455311613145 |
11 | 96a2656234a336 |
12 | 313540972425b5 |
13 | 1136752aa4aa26 |
14 | 5c14ccc7806b7 |
15 | 2867dd3d60015 |
hex | 12e5dc8c09cd9 |
332455311613145 has 32 divisors (see below), whose sum is σ = 466760532879360. Its totient is φ = 222620285606400.
The previous prime is 332455311613091. The next prime is 332455311613177. The reversal of 332455311613145 is 541316113554233.
It is not a de Polignac number, because 332455311613145 - 228 = 332455043177689 is a prime.
It is a super-2 number, since 2×3324553116131452 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 332455311613145.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 643897865 + ... + 644413974.
It is an arithmetic number, because the mean of its divisors is an integer number (14586266652480).
Almost surely, 2332455311613145 is an apocalyptic number.
332455311613145 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
332455311613145 is a deficient number, since it is larger than the sum of its proper divisors (134305221266215).
332455311613145 is a wasteful number, since it uses less digits than its factorization.
332455311613145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1288312025.
The product of its digits is 1944000, while the sum is 47.
The spelling of 332455311613145 in words is "three hundred thirty-two trillion, four hundred fifty-five billion, three hundred eleven million, six hundred thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •