Base | Representation |
---|---|
bin | 1001110001000000010101… |
… | …11101001101001001001100 |
3 | 2211000222210002101020111222 |
4 | 10320200022331031021030 |
5 | 10303321320143444110 |
6 | 113401253234102512 |
7 | 4344343010462231 |
oct | 470401275151114 |
9 | 84028702336458 |
10 | 21475020296780 |
11 | 692a5611176a6 |
12 | 24aa004a1aa38 |
13 | bca11644c35b |
14 | 54357a105788 |
15 | 27393421bc55 |
hex | 13880af4d24c |
21475020296780 has 12 divisors (see below), whose sum is σ = 45097542623280. Its totient is φ = 8590008118704.
The previous prime is 21475020296771. The next prime is 21475020296893. The reversal of 21475020296780 is 8769202057412.
It is a super-2 number, since 2×214750202967802 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 536875507400 + ... + 536875507439.
It is an arithmetic number, because the mean of its divisors is an integer number (3758128551940).
Almost surely, 221475020296780 is an apocalyptic number.
21475020296780 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21475020296780 is an abundant number, since it is smaller than the sum of its proper divisors (23622522326500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21475020296780 is a wasteful number, since it uses less digits than its factorization.
21475020296780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073751014848 (or 1073751014846 counting only the distinct ones).
The product of its (nonzero) digits is 3386880, while the sum is 53.
The spelling of 21475020296780 in words is "twenty-one trillion, four hundred seventy-five billion, twenty million, two hundred ninety-six thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •