Base | Representation |
---|---|
bin | 11010001000100011… |
… | …01011100111010110 |
3 | 1100012210122112121210 |
4 | 31010101223213112 |
5 | 212213234401140 |
6 | 10240115522250 |
7 | 1004454220215 |
oct | 150421534726 |
9 | 40183575553 |
10 | 14030387670 |
11 | 5a4a873a12 |
12 | 28768b9386 |
13 | 14279bb450 |
14 | 97154707c |
15 | 571b36d80 |
hex | 34446b9d6 |
14030387670 has 32 divisors (see below), whose sum is σ = 36263156832. Its totient is φ = 3453633792.
The previous prime is 14030387653. The next prime is 14030387687. The reversal of 14030387670 is 7678303041.
14030387670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (14030387653) and next prime (14030387687).
It is a Harshad number since it is a multiple of its sum of digits (39).
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 15 ways as a sum of consecutive naturals, for example, 17987287 + ... + 17988066.
It is an arithmetic number, because the mean of its divisors is an integer number (1133223651).
Almost surely, 214030387670 is an apocalyptic number.
14030387670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14030387670 is an abundant number, since it is smaller than the sum of its proper divisors (22232769162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14030387670 is a wasteful number, since it uses less digits than its factorization.
14030387670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35975376.
The product of its (nonzero) digits is 84672, while the sum is 39.
The spelling of 14030387670 in words is "fourteen billion, thirty million, three hundred eighty-seven thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •