Base | Representation |
---|---|
bin | 100010001001111… |
… | …0101000110010001 |
3 | 2221212111022120001 |
4 | 1010103311012101 |
5 | 4321342031123 |
6 | 305415450001 |
7 | 40254153322 |
oct | 10423650621 |
9 | 2855438501 |
10 | 1146048913 |
11 | 538a07569 |
12 | 27b986901 |
13 | 153584869 |
14 | ac2c8449 |
15 | 6a9300ad |
hex | 444f5191 |
1146048913 has 2 divisors, whose sum is σ = 1146048914. Its totient is φ = 1146048912.
The previous prime is 1146048833. The next prime is 1146048929. The reversal of 1146048913 is 3198406411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1004129344 + 141919569 = 31688^2 + 11913^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1146048913 is a prime.
It is a super-2 number, since 2×11460489132 = 2626856221976963138, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1146048613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 573024456 + 573024457.
It is an arithmetic number, because the mean of its divisors is an integer number (573024457).
Almost surely, 21146048913 is an apocalyptic number.
It is an amenable number.
1146048913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1146048913 is an equidigital number, since it uses as much as digits as its factorization.
1146048913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 1146048913 is about 33853.3441922656. The cubic root of 1146048913 is about 1046.4883176965.
The spelling of 1146048913 in words is "one billion, one hundred forty-six million, forty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •