Base | Representation |
---|---|
bin | 11010111100110110… |
… | …00010001001101010 |
3 | 1101100101001201221120 |
4 | 31132123002021222 |
5 | 214113034000030 |
6 | 10351425520110 |
7 | 1021361604114 |
oct | 153633021152 |
9 | 41311051846 |
10 | 14469046890 |
11 | 61554440a1 |
12 | 29797a3036 |
13 | 149784720c |
14 | 9b38d23b4 |
15 | 59a3d5010 |
hex | 35e6c226a |
14469046890 has 64 divisors (see below), whose sum is σ = 35644897152. Its totient is φ = 3757536000.
The previous prime is 14469046873. The next prime is 14469046901. The reversal of 14469046890 is 9864096441.
14469046890 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 31 ways as a sum of consecutive naturals, for example, 145689 + ... + 223971.
It is an arithmetic number, because the mean of its divisors is an integer number (556951518).
Almost surely, 214469046890 is an apocalyptic number.
14469046890 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14469046890, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17822448576).
14469046890 is an abundant number, since it is smaller than the sum of its proper divisors (21175850262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14469046890 is a wasteful number, since it uses less digits than its factorization.
14469046890 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78455.
The product of its (nonzero) digits is 1492992, while the sum is 51.
The spelling of 14469046890 in words is "fourteen billion, four hundred sixty-nine million, forty-six thousand, eight hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •