Base | Representation |
---|---|
bin | 10001101010101111111… |
… | …000010011100100101100 |
3 | 11022001212220201020221000 |
4 | 101222233320103210230 |
5 | 124343020134104013 |
6 | 2325433032440300 |
7 | 153501211620522 |
oct | 21525770234454 |
9 | 4261786636830 |
10 | 1214131550508 |
11 | 428a01676158 |
12 | 177382249090 |
13 | 8a652236006 |
14 | 42a9b286312 |
15 | 218b0656973 |
hex | 11aafe1392c |
1214131550508 has 24 divisors (see below), whose sum is σ = 3147748464560. Its totient is φ = 404710516800.
The previous prime is 1214131550503. The next prime is 1214131550531. The reversal of 1214131550508 is 8050551314121.
1214131550508 is a `hidden beast` number, since 1 + 2 + 14 + 131 + 5 + 5 + 0 + 508 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (1214131550503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5620979293 + ... + 5620979508.
Almost surely, 21214131550508 is an apocalyptic number.
1214131550508 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1214131550508 is an abundant number, since it is smaller than the sum of its proper divisors (1933616914052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1214131550508 is a wasteful number, since it uses less digits than its factorization.
1214131550508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11241958814 (or 11241958806 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 36.
Adding to 1214131550508 its reverse (8050551314121), we get a palindrome (9264682864629).
The spelling of 1214131550508 in words is "one trillion, two hundred fourteen billion, one hundred thirty-one million, five hundred fifty thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •