Base | Representation |
---|---|
bin | 11010111110100010… |
… | …10001010101010100 |
3 | 1101101100211002022202 |
4 | 31133101101111110 |
5 | 214130203433402 |
6 | 10353054344032 |
7 | 1021623501650 |
oct | 153721212524 |
9 | 41340732282 |
10 | 14483264852 |
11 | 6162475281 |
12 | 29824bb018 |
13 | 149a784904 |
14 | 9b5753a60 |
15 | 59b792b02 |
hex | 35f451554 |
14483264852 has 48 divisors (see below), whose sum is σ = 31659844608. Its totient is φ = 5653532160.
The previous prime is 14483264833. The next prime is 14483264891. The reversal of 14483264852 is 25846238441.
14483264852 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 = 14483264797 and 14483264806.
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 15 ways as a sum of consecutive naturals, for example, 476003 + ... + 505514.
It is an arithmetic number, because the mean of its divisors is an integer number (659580096).
Almost surely, 214483264852 is an apocalyptic number.
It is an amenable number.
14483264852 is an abundant number, since it is smaller than the sum of its proper divisors (17176579756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14483264852 is a wasteful number, since it uses less digits than its factorization.
14483264852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 981576 (or 981574 counting only the distinct ones).
The product of its digits is 1474560, while the sum is 47.
The spelling of 14483264852 in words is "fourteen billion, four hundred eighty-three million, two hundred sixty-four thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •