Base | Representation |
---|---|
bin | 10100000000001000… |
… | …010100001101110001 |
3 | 2001102202210110220002 |
4 | 110000020110031301 |
5 | 322441104011213 |
6 | 13511050555345 |
7 | 1360135425155 |
oct | 240010241561 |
9 | 61382713802 |
10 | 21477016433 |
11 | 9121241364 |
12 | 41b4738b55 |
13 | 20436b0762 |
14 | 107a525065 |
15 | 85a775658 |
hex | 500214371 |
21477016433 has 4 divisors (see below), whose sum is σ = 21492260580. Its totient is φ = 21461772288.
The previous prime is 21477016423. The next prime is 21477016439. The reversal of 21477016433 is 33461077412.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11736905569 + 9740110864 = 108337^2 + 98692^2 .
It is a cyclic number.
It is not a de Polignac number, because 21477016433 - 216 = 21476950897 is a prime.
It is a super-2 number, since 2×214770164332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21477016439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7619960 + ... + 7622777.
It is an arithmetic number, because the mean of its divisors is an integer number (5373065145).
Almost surely, 221477016433 is an apocalyptic number.
It is an amenable number.
21477016433 is a deficient number, since it is larger than the sum of its proper divisors (15244147).
21477016433 is a wasteful number, since it uses less digits than its factorization.
21477016433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15244146.
The product of its (nonzero) digits is 84672, while the sum is 38.
The spelling of 21477016433 in words is "twenty-one billion, four hundred seventy-seven million, sixteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •