Base | Representation |
---|---|
bin | 100000001110101… |
… | …1011100111001101 |
3 | 2210100221201020201 |
4 | 1000131123213031 |
5 | 4203323111401 |
6 | 255151213501 |
7 | 35541143104 |
oct | 10035334715 |
9 | 2710851221 |
10 | 1081457101 |
11 | 5054aa7aa |
12 | 262217291 |
13 | 14308a85a |
14 | a38b303b |
15 | 64e21b01 |
hex | 4075b9cd |
1081457101 has 2 divisors, whose sum is σ = 1081457102. Its totient is φ = 1081457100.
The previous prime is 1081457059. The next prime is 1081457107. The reversal of 1081457101 is 1017541801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1068309225 + 13147876 = 32685^2 + 3626^2 .
It is a cyclic number.
It is not a de Polignac number, because 1081457101 - 213 = 1081448909 is a prime.
It is a super-2 number, since 2×10814571012 = 2339098922606648402, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1081457101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1081457107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 540728550 + 540728551.
It is an arithmetic number, because the mean of its divisors is an integer number (540728551).
Almost surely, 21081457101 is an apocalyptic number.
It is an amenable number.
1081457101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1081457101 is an equidigital number, since it uses as much as digits as its factorization.
1081457101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 28.
The square root of 1081457101 is about 32885.5150636264. The cubic root of 1081457101 is about 1026.4467694817.
Adding to 1081457101 its reverse (1017541801), we get a palindrome (2098998902).
The spelling of 1081457101 in words is "one billion, eighty-one million, four hundred fifty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •