Base | Representation |
---|---|
bin | 100110001011111… |
… | …0100110100110101 |
3 | 10022022000111111211 |
4 | 1030113310310311 |
5 | 10111004022401 |
6 | 331051001421 |
7 | 43515663424 |
oct | 11427646465 |
9 | 3268014454 |
10 | 1281314101 |
11 | 5a82a5281 |
12 | 2b9139271 |
13 | 1755c4a32 |
14 | c22592bb |
15 | 7774d951 |
hex | 4c5f4d35 |
1281314101 has 4 divisors (see below), whose sum is σ = 1281541600. Its totient is φ = 1281086604.
The previous prime is 1281314057. The next prime is 1281314113. The reversal of 1281314101 is 1014131821.
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 1281314101 - 215 = 1281281333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1281314161) 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 3 ways as a sum of consecutive naturals, for example, 105081 + ... + 116638.
It is an arithmetic number, because the mean of its divisors is an integer number (320385400).
Almost surely, 21281314101 is an apocalyptic number.
It is an amenable number.
1281314101 is a deficient number, since it is larger than the sum of its proper divisors (227499).
1281314101 is an equidigital number, since it uses as much as digits as its factorization.
1281314101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227498.
The product of its (nonzero) digits is 192, while the sum is 22.
The square root of 1281314101 is about 35795.4480485997. The cubic root of 1281314101 is about 1086.1384840252.
Adding to 1281314101 its reverse (1014131821), we get a palindrome (2295445922).
The spelling of 1281314101 in words is "one billion, two hundred eighty-one million, three hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •