Base | Representation |
---|---|
bin | 110011001110100011… |
… | …100010011110110001 |
3 | 12020222101200001111020 |
4 | 303032203202132301 |
5 | 1400122241432241 |
6 | 41134032410053 |
7 | 3655035020613 |
oct | 631643423661 |
9 | 166871601436 |
10 | 55005030321 |
11 | 213669a644a |
12 | a7b10a6929 |
13 | 5257970127 |
14 | 293b340db3 |
15 | 166de91b66 |
hex | cce8e27b1 |
55005030321 has 8 divisors (see below), whose sum is σ = 73341779040. Its totient is φ = 36669150912.
The previous prime is 55005030299. The next prime is 55005030337. The reversal of 55005030321 is 12303050055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55005030321 - 26 = 55005030257 is a prime.
It is a super-2 number, since 2×550050303212 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55005030291 and 55005030300.
It is not an unprimeable number, because it can be changed into a prime (55005030371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51640 + ... + 335673.
It is an arithmetic number, because the mean of its divisors is an integer number (9167722380).
Almost surely, 255005030321 is an apocalyptic number.
It is an amenable number.
55005030321 is a deficient number, since it is larger than the sum of its proper divisors (18336748719).
55005030321 is a wasteful number, since it uses less digits than its factorization.
55005030321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434655.
The product of its (nonzero) digits is 2250, while the sum is 24.
Adding to 55005030321 its reverse (12303050055), we get a palindrome (67308080376).
The spelling of 55005030321 in words is "fifty-five billion, five million, thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •