Base | Representation |
---|---|
bin | 110000100001101111… |
… | …0011011110111110101 |
3 | 100221222122212212121211 |
4 | 1201003132123313311 |
5 | 3201411041021221 |
6 | 115512441041421 |
7 | 10346311104016 |
oct | 1410336336765 |
9 | 327878785554 |
10 | 104211267061 |
11 | 402175a8400 |
12 | 18244186271 |
13 | 9a9a131945 |
14 | 508848b00d |
15 | 2a9dce26e1 |
hex | 184379bdf5 |
104211267061 has 24 divisors (see below), whose sum is σ = 124242538392. Its totient is φ = 86989900800.
The previous prime is 104211267059. The next prime is 104211267107. The reversal of 104211267061 is 160762112401.
It can be written as a sum of positive squares in 4 ways, for example, as 26325062500 + 77886204561 = 162250^2 + 279081^2 .
It is not a de Polignac number, because 104211267061 - 21 = 104211267059 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104211267001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 533490 + ... + 702163.
It is an arithmetic number, because the mean of its divisors is an integer number (5176772433).
Almost surely, 2104211267061 is an apocalyptic number.
104211267061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104211267061 is a deficient number, since it is larger than the sum of its proper divisors (20031271331).
104211267061 is a wasteful number, since it uses less digits than its factorization.
104211267061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1235733 (or 1235722 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 104211267061 its reverse (160762112401), we get a palindrome (264973379462).
The spelling of 104211267061 in words is "one hundred four billion, two hundred eleven million, two hundred sixty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •