Base | Representation |
---|---|
bin | 100010001101110… |
… | …0101111111110101 |
3 | 2222000022201110112 |
4 | 1010123211333311 |
5 | 4322402143323 |
6 | 305531232405 |
7 | 40310361203 |
oct | 10433457765 |
9 | 2860281415 |
10 | 1148084213 |
11 | 53a077731 |
12 | 2805a8705 |
13 | 153b18093 |
14 | ac698073 |
15 | 6abd3178 |
hex | 446e5ff5 |
1148084213 has 8 divisors (see below), whose sum is σ = 1174696128. Its totient is φ = 1121766624.
The previous prime is 1148084207. The next prime is 1148084227. The reversal of 1148084213 is 3124808411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1148084213 - 26 = 1148084149 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1148084213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1148084293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65681 + ... + 81302.
It is an arithmetic number, because the mean of its divisors is an integer number (146837016).
Almost surely, 21148084213 is an apocalyptic number.
It is an amenable number.
1148084213 is a deficient number, since it is larger than the sum of its proper divisors (26611915).
1148084213 is a wasteful number, since it uses less digits than its factorization.
1148084213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147163.
The product of its (nonzero) digits is 6144, while the sum is 32.
The square root of 1148084213 is about 33883.3914034590. The cubic root of 1148084213 is about 1047.1074471919.
The spelling of 1148084213 in words is "one billion, one hundred forty-eight million, eighty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •