Base | Representation |
---|---|
bin | 11010111100111000… |
… | …01011010000111000 |
3 | 1101100101121221202001 |
4 | 31132130023100320 |
5 | 214113123040420 |
6 | 10351440150344 |
7 | 1021364262160 |
oct | 153634132070 |
9 | 41311557661 |
10 | 14469346360 |
11 | 6155629097 |
12 | 29799083b4 |
13 | 1497920611 |
14 | 9b396d5a0 |
15 | 59a443b0a |
hex | 35e70b438 |
14469346360 has 32 divisors (see below), whose sum is σ = 37206891360. Its totient is φ = 4960918656.
The previous prime is 14469346349. The next prime is 14469346399. The reversal of 14469346360 is 6364396441.
14469346360 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 14469346360.
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 7 ways as a sum of consecutive naturals, for example, 25837839 + ... + 25838398.
It is an arithmetic number, because the mean of its divisors is an integer number (1162715355).
Almost surely, 214469346360 is an apocalyptic number.
14469346360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14469346360 is an abundant number, since it is smaller than the sum of its proper divisors (22737545000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14469346360 is a wasteful number, since it uses less digits than its factorization.
14469346360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51676255 (or 51676251 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 46.
The spelling of 14469346360 in words is "fourteen billion, four hundred sixty-nine million, three hundred forty-six thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •