Base | Representation |
---|---|
bin | 10110110000110010… |
… | …10100101001101001 |
3 | 1011112122221020212100 |
4 | 23120121110221221 |
5 | 200011413421213 |
6 | 5340342404013 |
7 | 611556060201 |
oct | 133031245151 |
9 | 34478836770 |
10 | 12220451433 |
11 | 5201143043 |
12 | 2450730609 |
13 | 11c9a2c868 |
14 | 83d005401 |
15 | 4b7cb9773 |
hex | 2d8654a69 |
12220451433 has 12 divisors (see below), whose sum is σ = 18260445060. Its totient is φ = 7866037536.
The previous prime is 12220451413. The next prime is 12220451443. The reversal of 12220451433 is 33415402221.
12220451433 is a `hidden beast` number, since 1 + 2 + 220 + 4 + 5 + 1 + 433 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 9847982169 + 2372469264 = 99237^2 + 48708^2 .
It is not a de Polignac number, because 12220451433 - 25 = 12220451401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12220451397 and 12220451406.
It is not an unprimeable number, because it can be changed into a prime (12220451413) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23410566 + ... + 23411087.
It is an arithmetic number, because the mean of its divisors is an integer number (1521703755).
Almost surely, 212220451433 is an apocalyptic number.
It is an amenable number.
12220451433 is a deficient number, since it is larger than the sum of its proper divisors (6039993627).
12220451433 is a wasteful number, since it uses less digits than its factorization.
12220451433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46821688 (or 46821685 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 12220451433 its reverse (33415402221), we get a palindrome (45635853654).
The spelling of 12220451433 in words is "twelve billion, two hundred twenty million, four hundred fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •