Base | Representation |
---|---|
bin | 11010111100000101… |
… | …10001001101100011 |
3 | 1101022221002120111221 |
4 | 31132002301031203 |
5 | 214104421423201 |
6 | 10351041315511 |
7 | 1021253542312 |
oct | 153602611543 |
9 | 41287076457 |
10 | 14462686051 |
11 | 615189a100 |
12 | 2977635b97 |
13 | 149642abc8 |
14 | 9b2b18279 |
15 | 599a7a4a1 |
hex | 35e0b1363 |
14462686051 has 48 divisors (see below), whose sum is σ = 16941782592. Its totient is φ = 12311101440.
The previous prime is 14462686031. The next prime is 14462686079. The reversal of 14462686051 is 15068626441.
14462686051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14462686051 - 29 = 14462685539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14462685989 and 14462686007.
It is not an unprimeable number, because it can be changed into a prime (14462686031) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 52211725 + ... + 52212001.
It is an arithmetic number, because the mean of its divisors is an integer number (352953804).
Almost surely, 214462686051 is an apocalyptic number.
14462686051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14462686051 is a deficient number, since it is larger than the sum of its proper divisors (2479096541).
14462686051 is a wasteful number, since it uses less digits than its factorization.
14462686051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652 (or 641 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 43.
The spelling of 14462686051 in words is "fourteen billion, four hundred sixty-two million, six hundred eighty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •