Base | Representation |
---|---|
bin | 11010111100000000… |
… | …01110101101100110 |
3 | 1101022212211202111012 |
4 | 31132000032231212 |
5 | 214104234123304 |
6 | 10351015142222 |
7 | 1021245100640 |
oct | 153600165546 |
9 | 41285752435 |
10 | 14462020454 |
11 | 6151485022 |
12 | 2977374972 |
13 | 1496256c6b |
14 | 9b29c3890 |
15 | 59999816e |
hex | 35e00eb66 |
14462020454 has 32 divisors (see below), whose sum is σ = 25890554880. Its totient is φ = 5923808352.
The previous prime is 14462020427. The next prime is 14462020471. The reversal of 14462020454 is 45402026441.
14462020454 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×144620204542 (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 14462020454.
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 15 ways as a sum of consecutive naturals, for example, 402332 + ... + 436800.
It is an arithmetic number, because the mean of its divisors is an integer number (809079840).
Almost surely, 214462020454 is an apocalyptic number.
14462020454 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
14462020454 is a deficient number, since it is larger than the sum of its proper divisors (11428534426).
14462020454 is a wasteful number, since it uses less digits than its factorization.
14462020454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35804.
The product of its (nonzero) digits is 30720, while the sum is 32.
Adding to 14462020454 its reverse (45402026441), we get a palindrome (59864046895).
The spelling of 14462020454 in words is "fourteen billion, four hundred sixty-two million, twenty thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •