Base | Representation |
---|---|
bin | 11010000110001111… |
… | …10010000001000000 |
3 | 1100011110012022122002 |
4 | 31003013302001000 |
5 | 212143304441412 |
6 | 10234144403132 |
7 | 1004130443624 |
oct | 150307620100 |
9 | 40143168562 |
10 | 14011015232 |
11 | 5a3a942135 |
12 | 28703164a8 |
13 | 1423997876 |
14 | 96cb43184 |
15 | 5700abdc2 |
hex | 3431f2040 |
14011015232 has 56 divisors (see below), whose sum is σ = 28134183000. Its totient is φ = 6922321920.
The previous prime is 14011015201. The next prime is 14011015237. The reversal of 14011015232 is 23251011041.
It can be written as a sum of positive squares in 4 ways, for example, as 15178816 + 13995836416 = 3896^2 + 118304^2 .
It is not an unprimeable number, because it can be changed into a prime (14011015237) 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, 5095394 + ... + 5098142.
It is an arithmetic number, because the mean of its divisors is an integer number (502396125).
Almost surely, 214011015232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14011015232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14067091500).
14011015232 is an abundant number, since it is smaller than the sum of its proper divisors (14123167768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14011015232 is an equidigital number, since it uses as much as digits as its factorization.
14011015232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3679 (or 3669 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 14011015232 its reverse (23251011041), we get a palindrome (37262026273).
The spelling of 14011015232 in words is "fourteen billion, eleven million, fifteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •