Base | Representation |
---|---|
bin | 11010010001010011… |
… | …01110101110000000 |
3 | 1100101220210022101001 |
4 | 31020221232232000 |
5 | 212341033110304 |
6 | 10251301221344 |
7 | 1006335220330 |
oct | 151051565600 |
9 | 40356708331 |
10 | 14103800704 |
11 | 5a88256244 |
12 | 2897401854 |
13 | 1439c83606 |
14 | 97b1b70c0 |
15 | 5782d8da4 |
hex | 348a6eb80 |
14103800704 has 64 divisors (see below), whose sum is σ = 32186377440. Its totient is φ = 6030360576.
The previous prime is 14103800701. The next prime is 14103800747. The reversal of 14103800704 is 40700830141.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14103800701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 369792 + ... + 406144.
Almost surely, 214103800704 is an apocalyptic number.
14103800704 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14103800704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16093188720).
14103800704 is an abundant number, since it is smaller than the sum of its proper divisors (18082576736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14103800704 is an equidigital number, since it uses as much as digits as its factorization.
14103800704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36807 (or 36795 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 28.
The spelling of 14103800704 in words is "fourteen billion, one hundred three million, eight hundred thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •