Base | Representation |
---|---|
bin | 11000100111000000… |
… | …10100110111001111 |
3 | 1021002202222102000200 |
4 | 30103200110313033 |
5 | 204024302034210 |
6 | 10023010024543 |
7 | 645260235336 |
oct | 142340246717 |
9 | 37082872020 |
10 | 13212143055 |
11 | 566aa016a1 |
12 | 2688878153 |
13 | 132731b137 |
14 | 8d49ccd1d |
15 | 524da90c0 |
hex | 313814dcf |
13212143055 has 48 divisors (see below), whose sum is σ = 23277028320. Its totient is φ = 6931102464.
The previous prime is 13212143033. The next prime is 13212143129. The reversal of 13212143055 is 55034121231.
13212143055 is a `hidden beast` number, since 13 + 212 + 1 + 430 + 5 + 5 = 666.
13212143055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13212143055 - 218 = 13211880911 is a prime.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 2327761 + ... + 2333429.
It is an arithmetic number, because the mean of its divisors is an integer number (484938090).
Almost surely, 213212143055 is an apocalyptic number.
13212143055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13212143055 is a deficient number, since it is larger than the sum of its proper divisors (10064885265).
13212143055 is a wasteful number, since it uses less digits than its factorization.
13212143055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6520 (or 6517 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 13212143055 its reverse (55034121231), we get a palindrome (68246264286).
The spelling of 13212143055 in words is "thirteen billion, two hundred twelve million, one hundred forty-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •