Base | Representation |
---|---|
bin | 1001111101001101… |
… | …1000111001010101 |
3 | 20220021002012100101 |
4 | 2133103120321111 |
5 | 20433200110203 |
6 | 1121112214101 |
7 | 123142143550 |
oct | 23723307125 |
9 | 6807065311 |
10 | 2672660053 |
11 | 1151713068 |
12 | 62709a331 |
13 | 33793346b |
14 | 1b4d57697 |
15 | 10998441d |
hex | 9f4d8e55 |
2672660053 has 16 divisors (see below), whose sum is σ = 3216533760. Its totient is φ = 2171131776.
The previous prime is 2672660041. The next prime is 2672660059. The reversal of 2672660053 is 3500662762.
It is a cyclic number.
It is not a de Polignac number, because 2672660053 - 221 = 2670562901 is a prime.
It is a super-2 number, since 2×26726600532 = 14286223517803925618, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2672659994 and 2672660021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2672660059) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58600 + ... + 93697.
It is an arithmetic number, because the mean of its divisors is an integer number (201033360).
Almost surely, 22672660053 is an apocalyptic number.
2672660053 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2672660053 is a deficient number, since it is larger than the sum of its proper divisors (543873707).
2672660053 is a wasteful number, since it uses less digits than its factorization.
2672660053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152436.
The product of its (nonzero) digits is 90720, while the sum is 37.
The square root of 2672660053 is about 51697.7760933679. The cubic root of 2672660053 is about 1387.7606668553.
The spelling of 2672660053 in words is "two billion, six hundred seventy-two million, six hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •