Base | Representation |
---|---|
bin | 1010000111100101… |
… | …0000001010111111 |
3 | 21000021220012221001 |
4 | 2201321100022333 |
5 | 21030312441343 |
6 | 1125304151131 |
7 | 124210545106 |
oct | 24171201277 |
9 | 7007805831 |
10 | 2716140223 |
11 | 1174210395 |
12 | 6397684a7 |
13 | 343948084 |
14 | 1baa3503d |
15 | 10d6c244d |
hex | a1e502bf |
2716140223 has 16 divisors (see below), whose sum is σ = 2776790016. Its totient is φ = 2656327680.
The previous prime is 2716140157. The next prime is 2716140227. The reversal of 2716140223 is 3220416172.
2716140223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2716140223 - 225 = 2682585791 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2716140191 and 2716140200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2716140227) 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, 4756528 + ... + 4757098.
It is an arithmetic number, because the mean of its divisors is an integer number (173549376).
Almost surely, 22716140223 is an apocalyptic number.
2716140223 is a deficient number, since it is larger than the sum of its proper divisors (60649793).
2716140223 is a wasteful number, since it uses less digits than its factorization.
2716140223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1134.
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 2716140223 is about 52116.6021820302. The cubic root of 2716140223 is about 1395.2458164897.
Adding to 2716140223 its reverse (3220416172), we get a palindrome (5936556395).
The spelling of 2716140223 in words is "two billion, seven hundred sixteen million, one hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •