Base | Representation |
---|---|
bin | 1111011010101000… |
… | …11111101011000101 |
3 | 210100210202210121021 |
4 | 13231110133223011 |
5 | 113422243240401 |
6 | 3445134551141 |
7 | 412046300344 |
oct | 75524375305 |
9 | 23323683537 |
10 | 8276540101 |
11 | 3567989095 |
12 | 172b9684b1 |
13 | a1b918a0b |
14 | 5872d1b5b |
15 | 3369232a1 |
hex | 1ed51fac5 |
8276540101 has 16 divisors (see below), whose sum is σ = 8580096000. Its totient is φ = 7977486528.
The previous prime is 8276540099. The next prime is 8276540113. The reversal of 8276540101 is 1010456728.
8276540101 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 8276540101 - 21 = 8276540099 is a prime.
It is a super-2 number, since 2×82765401012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8276540131) 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, 2308156 + ... + 2311738.
It is an arithmetic number, because the mean of its divisors is an integer number (536256000).
Almost surely, 28276540101 is an apocalyptic number.
It is an amenable number.
8276540101 is a deficient number, since it is larger than the sum of its proper divisors (303555899).
8276540101 is a wasteful number, since it uses less digits than its factorization.
8276540101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4188.
The product of its (nonzero) digits is 13440, while the sum is 34.
The square root of 8276540101 is about 90975.4917601438. The cubic root of 8276540101 is about 2022.7844569989.
Adding to 8276540101 its reverse (1010456728), we get a palindrome (9286996829).
The spelling of 8276540101 in words is "eight billion, two hundred seventy-six million, five hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •