Base | Representation |
---|---|
bin | 11011100000101001… |
… | …01001111101110000 |
3 | 1102010022011110201220 |
4 | 31300110221331300 |
5 | 220221424133343 |
6 | 10441314425040 |
7 | 1031666346510 |
oct | 156024517560 |
9 | 42108143656 |
10 | 14769364848 |
11 | 6299a15457 |
12 | 2a42292180 |
13 | 1514b26954 |
14 | a01749840 |
15 | 5b6958183 |
hex | 370529f70 |
14769364848 has 120 divisors (see below), whose sum is σ = 46020947328. Its totient is φ = 3997689984.
The previous prime is 14769364811. The next prime is 14769364859. The reversal of 14769364848 is 84846396741.
14769364848 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14769364791 and 14769364800.
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 23 ways as a sum of consecutive naturals, for example, 60415 + ... + 182177.
Almost surely, 214769364848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14769364848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23010473664).
14769364848 is an abundant number, since it is smaller than the sum of its proper divisors (31251582480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14769364848 is a wasteful number, since it uses less digits than its factorization.
14769364848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121819 (or 121794 counting only the distinct ones).
The product of its digits is 27869184, while the sum is 60.
The spelling of 14769364848 in words is "fourteen billion, seven hundred sixty-nine million, three hundred sixty-four thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •