Base | Representation |
---|---|
bin | 1001001110001010110001… |
… | …11100000011110000001100 |
3 | 2122210120010222010021110220 |
4 | 10213011120330003300030 |
5 | 10124213402340242221 |
6 | 111043333304431340 |
7 | 4162016361241416 |
oct | 447053074036014 |
9 | 78716128107426 |
10 | 20278032743436 |
11 | 6508957922346 |
12 | 2336028178550 |
13 | b41296cb6280 |
14 | 501667b039b6 |
15 | 252728c330c6 |
hex | 127158f03c0c |
20278032743436 has 48 divisors (see below), whose sum is σ = 50984025523200. Its totient is φ = 6235847479872.
The previous prime is 20278032743429. The next prime is 20278032743467. The reversal of 20278032743436 is 63434723087202.
It is a super-2 number, since 2×202780327434362 (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 15 ways as a sum of consecutive naturals, for example, 36674826 + ... + 37223633.
It is an arithmetic number, because the mean of its divisors is an integer number (1062167198400).
Almost surely, 220278032743436 is an apocalyptic number.
20278032743436 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
20278032743436 is an abundant number, since it is smaller than the sum of its proper divisors (30705992779764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20278032743436 is a wasteful number, since it uses less digits than its factorization.
20278032743436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73900238 (or 73900236 counting only the distinct ones).
The product of its (nonzero) digits is 8128512, while the sum is 51.
The spelling of 20278032743436 in words is "twenty trillion, two hundred seventy-eight billion, thirty-two million, seven hundred forty-three thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •