Base | Representation |
---|---|
bin | 11010001110100001… |
… | …11011101111100000 |
3 | 1100100021222200200110 |
4 | 31013100323233200 |
5 | 212314103220412 |
6 | 10245110251320 |
7 | 1005633321066 |
oct | 150720735740 |
9 | 40307880613 |
10 | 14080523232 |
11 | 5a760a7566 |
12 | 288b656b40 |
13 | 14351c3469 |
14 | 978078036 |
15 | 57623bd3c |
hex | 34743bbe0 |
14080523232 has 48 divisors (see below), whose sum is σ = 36981850752. Its totient is φ = 4690907520.
The previous prime is 14080523231. The next prime is 14080523243. The reversal of 14080523232 is 23232508041.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×140805232322 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14080523232.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14080523231) 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, 137607 + ... + 217017.
It is an arithmetic number, because the mean of its divisors is an integer number (770455224).
Almost surely, 214080523232 is an apocalyptic number.
14080523232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14080523232 is an abundant number, since it is smaller than the sum of its proper divisors (22901327520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14080523232 is a wasteful number, since it uses less digits than its factorization.
14080523232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81271 (or 81263 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The spelling of 14080523232 in words is "fourteen billion, eighty million, five hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •