Base | Representation |
---|---|
bin | 11110001110101101… |
… | …00100001000110101 |
3 | 1112220001122011101020 |
4 | 33013112210020311 |
5 | 231214221424221 |
6 | 11242234051353 |
7 | 1113116221101 |
oct | 170726441065 |
9 | 45801564336 |
10 | 16229483061 |
11 | 6979135920 |
12 | 318b279b59 |
13 | 16b849411c |
14 | add62a901 |
15 | 64ec25ac6 |
hex | 3c75a4235 |
16229483061 has 32 divisors (see below), whose sum is σ = 24908398080. Its totient is φ = 9296078400.
The previous prime is 16229483047. The next prime is 16229483071. The reversal of 16229483061 is 16038492261.
16229483061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16229483061 - 25 = 16229483029 is a prime.
It is a super-2 number, since 2×162294830612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16229483021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 233226 + ... + 294708.
It is an arithmetic number, because the mean of its divisors is an integer number (778387440).
Almost surely, 216229483061 is an apocalyptic number.
16229483061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16229483061 is a deficient number, since it is larger than the sum of its proper divisors (8678915019).
16229483061 is a wasteful number, since it uses less digits than its factorization.
16229483061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61937.
The product of its (nonzero) digits is 124416, while the sum is 42.
The spelling of 16229483061 in words is "sixteen billion, two hundred twenty-nine million, four hundred eighty-three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •