Base | Representation |
---|---|
bin | 100100001011111… |
… | …1010000001100011 |
3 | 10010121210002200000 |
4 | 1020113322001203 |
5 | 4441320222111 |
6 | 320253031043 |
7 | 42042520020 |
oct | 11027720143 |
9 | 3117702600 |
10 | 1214226531 |
11 | 573443401 |
12 | 29a785483 |
13 | 164735a4b |
14 | b7394547 |
15 | 718eac56 |
hex | 485fa063 |
1214226531 has 24 divisors (see below), whose sum is σ = 2078678784. Its totient is φ = 693842760.
The previous prime is 1214226493. The next prime is 1214226551. The reversal of 1214226531 is 1356224121.
1214226531 is a `hidden beast` number, since 1 + 2 + 1 + 4 + 2 + 2 + 653 + 1 = 666.
It is not a de Polignac number, because 1214226531 - 26 = 1214226467 is a prime.
It is a super-2 number, since 2×12142265312 = 2948692137168587922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1214226495 and 1214226504.
It is not an unprimeable number, because it can be changed into a prime (1214226551) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 355215 + ... + 358616.
It is an arithmetic number, because the mean of its divisors is an integer number (86611616).
Almost surely, 21214226531 is an apocalyptic number.
1214226531 is a deficient number, since it is larger than the sum of its proper divisors (864452253).
1214226531 is an frugal number, since it uses more digits than its factorization.
1214226531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 713853 (or 713841 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 1214226531 is about 34845.7534141536. The cubic root of 1214226531 is about 1066.8415114534.
The spelling of 1214226531 in words is "one billion, two hundred fourteen million, two hundred twenty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •