Base | Representation |
---|---|
bin | 100110110011011… |
… | …0100011110011001 |
3 | 10100201222120110120 |
4 | 1031212310132121 |
5 | 10131304201131 |
6 | 333110503453 |
7 | 44160001425 |
oct | 11546643631 |
9 | 3321876416 |
10 | 1302022041 |
11 | 608a59481 |
12 | 304064b89 |
13 | 179995458 |
14 | c4cc9b85 |
15 | 7948e496 |
hex | 4d9b4799 |
1302022041 has 16 divisors (see below), whose sum is σ = 1793809920. Its totient is φ = 839180160.
The previous prime is 1302022037. The next prime is 1302022067. The reversal of 1302022041 is 1402202031.
It is not a de Polignac number, because 1302022041 - 22 = 1302022037 is a prime.
It is a super-2 number, since 2×13020220412 = 3390522790499611362, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1302022041.
It is not an unprimeable number, because it can be changed into a prime (1302022031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95245 + ... + 108053.
It is an arithmetic number, because the mean of its divisors is an integer number (112113120).
Almost surely, 21302022041 is an apocalyptic number.
It is an amenable number.
1302022041 is a deficient number, since it is larger than the sum of its proper divisors (491787879).
1302022041 is a wasteful number, since it uses less digits than its factorization.
1302022041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13936.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 1302022041 is about 36083.5425228732. The cubic root of 1302022041 is about 1091.9584466403.
Adding to 1302022041 its reverse (1402202031), we get a palindrome (2704224072).
The spelling of 1302022041 in words is "one billion, three hundred two million, twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •