Base | Representation |
---|---|
bin | 11010110100100011… |
… | …01011011100001110 |
3 | 1101011112011122221120 |
4 | 31122101223130032 |
5 | 213442232020320 |
6 | 10340502541410 |
7 | 1016555415621 |
oct | 153221533416 |
9 | 41145148846 |
10 | 14399485710 |
11 | 611a152815 |
12 | 295a437866 |
13 | 148630035c |
14 | 9a8585db8 |
15 | 594244440 |
hex | 35a46b70e |
14399485710 has 32 divisors (see below), whose sum is σ = 35750449440. Its totient is φ = 3707453568.
The previous prime is 14399485703. The next prime is 14399485733. The reversal of 14399485710 is 1758499341.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8274697 + ... + 8276436.
It is an arithmetic number, because the mean of its divisors is an integer number (1117201545).
Almost surely, 214399485710 is an apocalyptic number.
14399485710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14399485710 is an abundant number, since it is smaller than the sum of its proper divisors (21350963730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14399485710 is a wasteful number, since it uses less digits than its factorization.
14399485710 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16551172.
The product of its (nonzero) digits is 1088640, while the sum is 51.
The spelling of 14399485710 in words is "fourteen billion, three hundred ninety-nine million, four hundred eighty-five thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •