Base | Representation |
---|---|
bin | 100000110111101… |
… | …1011100111010001 |
3 | 2211212101210221220 |
4 | 1001233123213101 |
5 | 4224323443123 |
6 | 301240035253 |
7 | 36221642106 |
oct | 10157334721 |
9 | 2755353856 |
10 | 1102952913 |
11 | 516651937 |
12 | 269462b29 |
13 | 147675a7a |
14 | a66aaaad |
15 | 66c6ace3 |
hex | 41bdb9d1 |
1102952913 has 4 divisors (see below), whose sum is σ = 1470603888. Its totient is φ = 735301940.
The previous prime is 1102952909. The next prime is 1102952941. The reversal of 1102952913 is 3192592011.
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 1102952913 - 22 = 1102952909 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1102957913) 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, 183825483 + ... + 183825488.
It is an arithmetic number, because the mean of its divisors is an integer number (367650972).
Almost surely, 21102952913 is an apocalyptic number.
It is an amenable number.
1102952913 is a deficient number, since it is larger than the sum of its proper divisors (367650975).
1102952913 is an equidigital number, since it uses as much as digits as its factorization.
1102952913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367650974.
The product of its (nonzero) digits is 4860, while the sum is 33.
The square root of 1102952913 is about 33210.7349060511. The cubic root of 1102952913 is about 1033.2029972159.
The spelling of 1102952913 in words is "one billion, one hundred two million, nine hundred fifty-two thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •