Base | Representation |
---|---|
bin | 11110100110011010… |
… | …10111111010010000 |
3 | 1120101220221012111100 |
4 | 33103031113322100 |
5 | 232121132302042 |
6 | 11314101344400 |
7 | 1121053045464 |
oct | 172315277220 |
9 | 46356835440 |
10 | 16428400272 |
11 | 6a70449309 |
12 | 3225a08100 |
13 | 171a75c60b |
14 | b1bc0a4a4 |
15 | 66241924c |
hex | 3d3357e90 |
16428400272 has 30 divisors (see below), whose sum is σ = 45976703942. Its totient is φ = 5476133376.
The previous prime is 16428400259. The next prime is 16428400277. The reversal of 16428400272 is 27200482461.
16428400272 is a `hidden beast` number, since 1 + 642 + 8 + 4 + 0 + 0 + 2 + 7 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 14961203856 + 1467196416 = 122316^2 + 38304^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (16428400277) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 57042913 + ... + 57043200.
Almost surely, 216428400272 is an apocalyptic number.
16428400272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16428400272 is an abundant number, since it is smaller than the sum of its proper divisors (29548303670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16428400272 is a wasteful number, since it uses less digits than its factorization.
16428400272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114086127 (or 114086118 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 36.
The spelling of 16428400272 in words is "sixteen billion, four hundred twenty-eight million, four hundred thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •