Base | Representation |
---|---|
bin | 1111101110101111… |
… | …11110100111101000 |
3 | 210210120011220101201 |
4 | 13313113332213220 |
5 | 114243434203243 |
6 | 3514002253544 |
7 | 416165142352 |
oct | 76727764750 |
9 | 23716156351 |
10 | 8445225448 |
11 | 3644122970 |
12 | 17783572b4 |
13 | a4785a82a |
14 | 5a18820d2 |
15 | 34664404d |
hex | 1f75fe9e8 |
8445225448 has 32 divisors (see below), whose sum is σ = 17294729760. Its totient is φ = 3834204480.
The previous prime is 8445225433. The next prime is 8445225449.
8445225448 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 8445225398 and 8445225407.
It is not an unprimeable number, because it can be changed into a prime (8445225449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18811 + ... + 131317.
It is an arithmetic number, because the mean of its divisors is an integer number (540460305).
Almost surely, 28445225448 is an apocalyptic number.
8445225448 is a gapful number since it is divisible by the number (88) formed by its first and last digit.
It is an amenable number.
8445225448 is an abundant number, since it is smaller than the sum of its proper divisors (8849504312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8445225448 is a wasteful number, since it uses less digits than its factorization.
8445225448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113377 (or 113373 counting only the distinct ones).
The product of its digits is 1638400, while the sum is 46.
The square root of 8445225448 is about 91897.9077454977. The cubic root of 8445225448 is about 2036.4343589726.
The spelling of 8445225448 in words is "eight billion, four hundred forty-five million, two hundred twenty-five thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •