Base | Representation |
---|---|
bin | 11010100101000100… |
… | …11000010110111110 |
3 | 1100211110212010201102 |
4 | 31102202120112332 |
5 | 213211012140040 |
6 | 10315544013102 |
7 | 1013420664155 |
oct | 152242302676 |
9 | 40743763642 |
10 | 14269646270 |
11 | 60629304a0 |
12 | 2922a61192 |
13 | 146543c999 |
14 | 99522859c |
15 | 587b48515 |
hex | 3528985be |
14269646270 has 32 divisors (see below), whose sum is σ = 28924286976. Its totient is φ = 5021575200.
The previous prime is 14269646257. The next prime is 14269646291. The reversal of 14269646270 is 7264696241.
14269646270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
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, 2088914 + ... + 2095733.
It is an arithmetic number, because the mean of its divisors is an integer number (903883968).
Almost surely, 214269646270 is an apocalyptic number.
14269646270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14269646270 is an abundant number, since it is smaller than the sum of its proper divisors (14654640706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14269646270 is a wasteful number, since it uses less digits than its factorization.
14269646270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4184696.
The product of its (nonzero) digits is 870912, while the sum is 47.
The spelling of 14269646270 in words is "fourteen billion, two hundred sixty-nine million, six hundred forty-six thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •