Base | Representation |
---|---|
bin | 100001011010110… |
… | …0000000010001011 |
3 | 2220010222000101002 |
4 | 1002311200002023 |
5 | 4244024233344 |
6 | 303133445215 |
7 | 36534033503 |
oct | 10265400213 |
9 | 2803860332 |
10 | 1121321099 |
11 | 525a58158 |
12 | 27364080b |
13 | 14b407512 |
14 | a8ccca03 |
15 | 6869844e |
hex | 42d6008b |
1121321099 has 4 divisors (see below), whose sum is σ = 1136681736. Its totient is φ = 1105960464.
The previous prime is 1121321051. The next prime is 1121321101. The reversal of 1121321099 is 9901231211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9901231211 = 2089 ⋅4739699.
It is a cyclic number.
It is not a de Polignac number, because 1121321099 - 28 = 1121320843 is a prime.
It is a super-2 number, since 2×11213210992 = 2514722014125135602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121321699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7680209 + ... + 7680354.
It is an arithmetic number, because the mean of its divisors is an integer number (284170434).
Almost surely, 21121321099 is an apocalyptic number.
1121321099 is a deficient number, since it is larger than the sum of its proper divisors (15360637).
1121321099 is an equidigital number, since it uses as much as digits as its factorization.
1121321099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15360636.
The product of its (nonzero) digits is 972, while the sum is 29.
The square root of 1121321099 is about 33486.1329358886. The cubic root of 1121321099 is about 1038.9069812849.
The spelling of 1121321099 in words is "one billion, one hundred twenty-one million, three hundred twenty-one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •