Base | Representation |
---|---|
bin | 100010001000010… |
… | …1000101010001110 |
3 | 2221210220202220000 |
4 | 1010100220222032 |
5 | 4321133232114 |
6 | 305345505130 |
7 | 40244065065 |
oct | 10420505216 |
9 | 2853822800 |
10 | 1145211534 |
11 | 538495415 |
12 | 27b6421a6 |
13 | 15335067c |
14 | ac14b1dc |
15 | 6a816e09 |
hex | 44428a8e |
1145211534 has 20 divisors (see below), whose sum is σ = 2566122504. Its totient is φ = 381737124.
The previous prime is 1145211527. The next prime is 1145211539. The reversal of 1145211534 is 4351125411.
1145211534 is a `hidden beast` number, since 114 + 5 + 2 + 11 + 534 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1145211498 and 1145211507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145211539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3534442 + ... + 3534765.
Almost surely, 21145211534 is an apocalyptic number.
1145211534 is an abundant number, since it is smaller than the sum of its proper divisors (1420910970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1145211534 is an equidigital number, since it uses as much as digits as its factorization.
1145211534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7069221 (or 7069212 counting only the distinct ones).
The product of its digits is 2400, while the sum is 27.
The square root of 1145211534 is about 33840.9741881052. The cubic root of 1145211534 is about 1046.2333777758.
Adding to 1145211534 its reverse (4351125411), we get a palindrome (5496336945).
The spelling of 1145211534 in words is "one billion, one hundred forty-five million, two hundred eleven thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •