Base | Representation |
---|---|
bin | 1000011110011101… |
… | …0000101011011011 |
3 | 12212120012221201122 |
4 | 2013213100223123 |
5 | 14124423403331 |
6 | 1013433435455 |
7 | 110245006031 |
oct | 20747205333 |
9 | 5776187648 |
10 | 2275216091 |
11 | a68333585 |
12 | 535b6bb8b |
13 | 2a34a8415 |
14 | 17825a551 |
15 | d4b2817b |
hex | 879d0adb |
2275216091 has 4 divisors (see below), whose sum is σ = 2323624992. Its totient is φ = 2226807192.
The previous prime is 2275216081. The next prime is 2275216127. The reversal of 2275216091 is 1906125722.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1906125722 = 2 ⋅953062861.
It is a cyclic number.
It is not a de Polignac number, because 2275216091 - 210 = 2275215067 is a prime.
It is a super-3 number, since 3×22752160913 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2275216081) 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, 24204380 + ... + 24204473.
It is an arithmetic number, because the mean of its divisors is an integer number (580906248).
Almost surely, 22275216091 is an apocalyptic number.
2275216091 is a deficient number, since it is larger than the sum of its proper divisors (48408901).
2275216091 is an equidigital number, since it uses as much as digits as its factorization.
2275216091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48408900.
The product of its (nonzero) digits is 15120, while the sum is 35.
The square root of 2275216091 is about 47699.2252662452. The cubic root of 2275216091 is about 1315.2476974643.
The spelling of 2275216091 in words is "two billion, two hundred seventy-five million, two hundred sixteen thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •