Base | Representation |
---|---|
bin | 100010010011110… |
… | …1010000001000001 |
3 | 2222020021101011121 |
4 | 1010213222001001 |
5 | 4324204341101 |
6 | 310123112241 |
7 | 40346301334 |
oct | 10447520101 |
9 | 2866241147 |
10 | 1151246401 |
11 | 540937508 |
12 | 281672681 |
13 | 1546844b6 |
14 | acc7c61b |
15 | 6b10a0a1 |
hex | 449ea041 |
1151246401 has 4 divisors (see below), whose sum is σ = 1152230704. Its totient is φ = 1150262100.
The previous prime is 1151246399. The next prime is 1151246413. The reversal of 1151246401 is 1046421511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1151246401 - 21 = 1151246399 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1151246431) 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 3 ways as a sum of consecutive naturals, for example, 490395 + ... + 492736.
It is an arithmetic number, because the mean of its divisors is an integer number (288057676).
Almost surely, 21151246401 is an apocalyptic number.
It is an amenable number.
1151246401 is a deficient number, since it is larger than the sum of its proper divisors (984303).
1151246401 is an equidigital number, since it uses as much as digits as its factorization.
1151246401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 984302.
The product of its (nonzero) digits is 960, while the sum is 25.
The square root of 1151246401 is about 33930.0221190615. The cubic root of 1151246401 is about 1048.0679212360.
Adding to 1151246401 its reverse (1046421511), we get a palindrome (2197667912).
The spelling of 1151246401 in words is "one billion, one hundred fifty-one million, two hundred forty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •