Base | Representation |
---|---|
bin | 1001111101110010… |
… | …1111001001011101 |
3 | 20220102200200201102 |
4 | 2133130233021131 |
5 | 20434312013433 |
6 | 1121240522445 |
7 | 123202030646 |
oct | 23734571135 |
9 | 6812620642 |
10 | 2675110493 |
11 | 1153037120 |
12 | 627a80425 |
13 | 3382b0923 |
14 | 1b53d46cd |
15 | 109cba4e8 |
hex | 9f72f25d |
2675110493 has 4 divisors (see below), whose sum is σ = 2918302368. Its totient is φ = 2431918620.
The previous prime is 2675110483. The next prime is 2675110511. The reversal of 2675110493 is 3940115762.
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 2675110493 - 28 = 2675110237 is a prime.
It is a super-3 number, since 3×26751104933 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2675110483) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 121595921 + ... + 121595942.
It is an arithmetic number, because the mean of its divisors is an integer number (729575592).
Almost surely, 22675110493 is an apocalyptic number.
It is an amenable number.
2675110493 is a deficient number, since it is larger than the sum of its proper divisors (243191875).
2675110493 is a wasteful number, since it uses less digits than its factorization.
2675110493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243191874.
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 2675110493 is about 51721.4703290616. The cubic root of 2675110493 is about 1388.1846621032.
The spelling of 2675110493 in words is "two billion, six hundred seventy-five million, one hundred ten thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •