Base | Representation |
---|---|
bin | 1001101010100000000… |
… | …11011001101010110001 |
3 | 1011202002112002201111110 |
4 | 10311100003121222301 |
5 | 20420022210110031 |
6 | 412313314503533 |
7 | 32663434416243 |
oct | 4652003315261 |
9 | 1152075081443 |
10 | 332055550641 |
11 | 118907779a11 |
12 | 54430894ba9 |
13 | 2540b01aa59 |
14 | 12100586093 |
15 | 89869bec46 |
hex | 4d500d9ab1 |
332055550641 has 12 divisors (see below), whose sum is σ = 443691691472. Its totient is φ = 220895905368.
The previous prime is 332055550639. The next prime is 332055550643. The reversal of 332055550641 is 146055550233.
It is an interprime number because it is at equal distance from previous prime (332055550639) and next prime (332055550643).
It is not a de Polignac number, because 332055550641 - 21 = 332055550639 is a prime.
It is a super-2 number, since 2×3320555506412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 332055550641.
It is not an unprimeable number, because it can be changed into a prime (332055550643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 400506 + ... + 908028.
Almost surely, 2332055550641 is an apocalyptic number.
It is an amenable number.
332055550641 is a deficient number, since it is larger than the sum of its proper divisors (111636140831).
332055550641 is an frugal number, since it uses more digits than its factorization.
332055550641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508460 (or 507993 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 39.
The spelling of 332055550641 in words is "three hundred thirty-two billion, fifty-five million, five hundred fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •