Base | Representation |
---|---|
bin | 11110000110111011… |
… | …00100101001000110 |
3 | 1112201111211000022111 |
4 | 33003131210221012 |
5 | 231101014230040 |
6 | 11231543051234 |
7 | 1111364346244 |
oct | 170335445106 |
9 | 45644730274 |
10 | 16164211270 |
11 | 6945304199 |
12 | 3171440b1a |
13 | 16a7abc76c |
14 | ad4ab9794 |
15 | 649130dea |
hex | 3c3764a46 |
16164211270 has 128 divisors (see below), whose sum is σ = 31703113728. Its totient is φ = 5922201600.
The previous prime is 16164211267. The next prime is 16164211289. The reversal of 16164211270 is 7211246161.
16164211270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×161642112702 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 83752294 + ... + 83752486.
It is an arithmetic number, because the mean of its divisors is an integer number (247680576).
Almost surely, 216164211270 is an apocalyptic number.
16164211270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16164211270 is a deficient number, since it is larger than the sum of its proper divisors (15538902458).
16164211270 is a wasteful number, since it uses less digits than its factorization.
16164211270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438.
The product of its (nonzero) digits is 4032, while the sum is 31.
The spelling of 16164211270 in words is "sixteen billion, one hundred sixty-four million, two hundred eleven thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •