Base | Representation |
---|---|
bin | 11010001000001101… |
… | …00011101011111010 |
3 | 1100012121011101112120 |
4 | 31010012203223322 |
5 | 212212013042420 |
6 | 10235533222110 |
7 | 1004420353455 |
oct | 150406435372 |
9 | 40177141476 |
10 | 14027471610 |
11 | 5a49162049 |
12 | 2875931936 |
13 | 142720a079 |
14 | 970dc849c |
15 | 57175cd40 |
hex | 3441a3afa |
14027471610 has 128 divisors (see below), whose sum is σ = 36064106496. Its totient is φ = 3483406080.
The previous prime is 14027471609. The next prime is 14027471629. The reversal of 14027471610 is 1617472041.
14027471610 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 12490509 + ... + 12491631.
It is an arithmetic number, because the mean of its divisors is an integer number (281750832).
Almost surely, 214027471610 is an apocalyptic number.
14027471610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14027471610, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18032053248).
14027471610 is an abundant number, since it is smaller than the sum of its proper divisors (22036634886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14027471610 is a wasteful number, since it uses less digits than its factorization.
14027471610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1620.
The product of its (nonzero) digits is 9408, while the sum is 33.
The spelling of 14027471610 in words is "fourteen billion, twenty-seven million, four hundred seventy-one thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •