Base | Representation |
---|---|
bin | 11011010001010110… |
… | …00101001111110000 |
3 | 1101210100200011222102 |
4 | 31220223011033300 |
5 | 214441100313112 |
6 | 10420451555532 |
7 | 1025550445043 |
oct | 155053051760 |
9 | 41710604872 |
10 | 14641026032 |
11 | 6233528616 |
12 | 2a072bbba8 |
13 | 14c4370319 |
14 | 9cc69cc5a |
15 | 5aa556bc2 |
hex | 368ac53f0 |
14641026032 has 20 divisors (see below), whose sum is σ = 28708761480. Its totient is φ = 7232313408.
The previous prime is 14641026007. The next prime is 14641026041. The reversal of 14641026032 is 23062014641.
14641026032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14641025986 and 14641026004.
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 3 ways as a sum of consecutive naturals, for example, 5511107 + ... + 5513762.
It is an arithmetic number, because the mean of its divisors is an integer number (1435438074).
Almost surely, 214641026032 is an apocalyptic number.
It is an amenable number.
14641026032 is a deficient number, since it is larger than the sum of its proper divisors (14067735448).
14641026032 is a wasteful number, since it uses less digits than its factorization.
14641026032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11024960 (or 11024954 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
The spelling of 14641026032 in words is "fourteen billion, six hundred forty-one million, twenty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •