Base | Representation |
---|---|
bin | 10001101011101010111… |
… | …000011000000001000011 |
3 | 11022011102220100001200220 |
4 | 101223222320120001003 |
5 | 124402032041040301 |
6 | 2330115153114123 |
7 | 153534561455424 |
oct | 21535270300103 |
9 | 4264386301626 |
10 | 1215121424451 |
11 | 42936a4030a0 |
12 | 1775b9858943 |
13 | 8a77c33913c |
14 | 42b5291964b |
15 | 2191c4d7936 |
hex | 11aeae18043 |
1215121424451 has 32 divisors (see below), whose sum is σ = 1771058359296. Its totient is φ = 734934144000.
The previous prime is 1215121424443. The next prime is 1215121424471. The reversal of 1215121424451 is 1544241215121.
It is not a de Polignac number, because 1215121424451 - 23 = 1215121424443 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (1215121424431) 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 31 ways as a sum of consecutive naturals, for example, 144121206 + ... + 144129636.
It is an arithmetic number, because the mean of its divisors is an integer number (55345573728).
Almost surely, 21215121424451 is an apocalyptic number.
1215121424451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1215121424451 is a deficient number, since it is larger than the sum of its proper divisors (555936934845).
1215121424451 is a wasteful number, since it uses less digits than its factorization.
1215121424451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16843.
The product of its digits is 12800, while the sum is 33.
Adding to 1215121424451 its reverse (1544241215121), we get a palindrome (2759362639572).
The spelling of 1215121424451 in words is "one trillion, two hundred fifteen billion, one hundred twenty-one million, four hundred twenty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •