Base | Representation |
---|---|
bin | 11010011110011100… |
… | …01100110011010000 |
3 | 1100200121012020212011 |
4 | 31033032030303100 |
5 | 213102242240100 |
6 | 10310235512304 |
7 | 1012144133242 |
oct | 151716146320 |
9 | 40617166764 |
10 | 14214024400 |
11 | 603449aa04 |
12 | 29082b8694 |
13 | 1456a66734 |
14 | 98baaa092 |
15 | 582d0cbba |
hex | 34f38ccd0 |
14214024400 has 30 divisors (see below), whose sum is σ = 34149194582. Its totient is φ = 5685609600.
The previous prime is 14214024347. The next prime is 14214024437. The reversal of 14214024400 is 442041241.
14214024400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 61591104 + 14152433296 = 7848^2 + 118964^2 .
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 5 ways as a sum of consecutive naturals, for example, 17767131 + ... + 17767930.
Almost surely, 214214024400 is an apocalyptic number.
14214024400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14214024400 is an abundant number, since it is smaller than the sum of its proper divisors (19935170182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14214024400 is a wasteful number, since it uses less digits than its factorization.
14214024400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35535079 (or 35535068 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 14214024400 its reverse (442041241), we get a palindrome (14656065641).
The spelling of 14214024400 in words is "fourteen billion, two hundred fourteen million, twenty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •