Base | Representation |
---|---|
bin | 11010001100010101… |
… | …01011011101000000 |
3 | 1100022000100000120202 |
4 | 31012022223131000 |
5 | 212244344401212 |
6 | 10243211424332 |
7 | 1005320634563 |
oct | 150612533500 |
9 | 40260300522 |
10 | 14062106432 |
11 | 5a66768770 |
12 | 28854550a8 |
13 | 143144584a |
14 | 9758424da |
15 | 5748000c2 |
hex | 3462ab740 |
14062106432 has 28 divisors (see below), whose sum is σ = 30441266016. Its totient is φ = 6391866240.
The previous prime is 14062106411. The next prime is 14062106437. The reversal of 14062106432 is 23460126041.
It is a junction number, because it is equal to n+sod(n) for n = 14062106395 and 14062106404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14062106437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9986588 + ... + 9987995.
It is an arithmetic number, because the mean of its divisors is an integer number (1087188072).
Almost surely, 214062106432 is an apocalyptic number.
It is an amenable number.
14062106432 is an abundant number, since it is smaller than the sum of its proper divisors (16379159584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14062106432 is a wasteful number, since it uses less digits than its factorization.
14062106432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19974606 (or 19974596 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
The spelling of 14062106432 in words is "fourteen billion, sixty-two million, one hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •