Base | Representation |
---|---|
bin | 11010111000010011… |
… | …11100111100000100 |
3 | 1101020201111111112110 |
4 | 31130021330330010 |
5 | 214023314432120 |
6 | 10343550421020 |
7 | 1020420413016 |
oct | 153411747404 |
9 | 41221444473 |
10 | 14431014660 |
11 | 6135a279a7 |
12 | 2968b01770 |
13 | 148c9bc23a |
14 | 9ac8321b6 |
15 | 596dc12e0 |
hex | 35c27cf04 |
14431014660 has 48 divisors (see below), whose sum is σ = 42163664256. Its totient is φ = 3680954112.
The previous prime is 14431014643. The next prime is 14431014667. The reversal of 14431014660 is 6641013441.
14431014660 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (14431014667) 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 15 ways as a sum of consecutive naturals, for example, 5227249 + ... + 5230008.
It is an arithmetic number, because the mean of its divisors is an integer number (878409672).
Almost surely, 214431014660 is an apocalyptic number.
14431014660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14431014660 is an abundant number, since it is smaller than the sum of its proper divisors (27732649596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14431014660 is a wasteful number, since it uses less digits than its factorization.
14431014660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10457292 (or 10457290 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 14431014660 in words is "fourteen billion, four hundred thirty-one million, fourteen thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •