Base | Representation |
---|---|
bin | 10010111111100110111… |
… | …110000001111010010001 |
3 | 11121210002010100201202012 |
4 | 102333212332001322101 |
5 | 132341123012023441 |
6 | 2435342411432305 |
7 | 163205212612655 |
oct | 22774676017221 |
9 | 4553063321665 |
10 | 1305250111121 |
11 | 46360a729400 |
12 | 190b71755695 |
13 | 96113a07178 |
14 | 47262954a65 |
15 | 23e44cd39eb |
hex | 12fe6f81e91 |
1305250111121 has 48 divisors (see below), whose sum is σ = 1480362369024. Its totient is φ = 1149312780000.
The previous prime is 1305250111097. The next prime is 1305250111133. The reversal of 1305250111121 is 1211110525031.
It is a de Polignac number, because none of the positive numbers 2k-1305250111121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1305250111171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 618307856 + ... + 618309966.
It is an arithmetic number, because the mean of its divisors is an integer number (30840882688).
Almost surely, 21305250111121 is an apocalyptic number.
1305250111121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1305250111121 is a deficient number, since it is larger than the sum of its proper divisors (175112257903).
1305250111121 is a wasteful number, since it uses less digits than its factorization.
1305250111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3114 (or 3103 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 1305250111121 its reverse (1211110525031), we get a palindrome (2516360636152).
The spelling of 1305250111121 in words is "one trillion, three hundred five billion, two hundred fifty million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •