Base | Representation |
---|---|
bin | 1010100010111000… |
… | …00011011111000111 |
3 | 112121112200121211201 |
4 | 11101130003133013 |
5 | 43043241313403 |
6 | 2333432443331 |
7 | 260202024100 |
oct | 52134033707 |
9 | 15545617751 |
10 | 5661276103 |
11 | 244570858a |
12 | 111bb49547 |
13 | 6c2b60222 |
14 | 3b9c393a7 |
15 | 23202a21d |
hex | 1517037c7 |
5661276103 has 12 divisors (see below), whose sum is σ = 6590910000. Its totient is φ = 4848584832.
The previous prime is 5661276077. The next prime is 5661276109. The reversal of 5661276103 is 3016721665.
It is not a de Polignac number, because 5661276103 - 217 = 5661145031 is a prime.
It is a super-2 number, since 2×56612761032 = 64100094228797733218, which 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 (5661276109) 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 11 ways as a sum of consecutive naturals, for example, 14950 + ... + 107452.
It is an arithmetic number, because the mean of its divisors is an integer number (549242500).
Almost surely, 25661276103 is an apocalyptic number.
5661276103 is a deficient number, since it is larger than the sum of its proper divisors (929633897).
5661276103 is a wasteful number, since it uses less digits than its factorization.
5661276103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93766 (or 93759 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 5661276103 is about 75241.4520261272. The cubic root of 5661276103 is about 1782.2615808902.
Adding to 5661276103 its reverse (3016721665), we get a palindrome (8677997768).
The spelling of 5661276103 in words is "five billion, six hundred sixty-one million, two hundred seventy-six thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •