Base | Representation |
---|---|
bin | 11101011001011100110… |
… | …10011101111000100001 |
3 | 10120120020022211121012212 |
4 | 32230232122131320201 |
5 | 113022134034122031 |
6 | 2052010502531505 |
7 | 132656056242623 |
oct | 16545632357041 |
9 | 3516208747185 |
10 | 1010096004641 |
11 | 35a419952689 |
12 | 14391b136b95 |
13 | 74336b2b099 |
14 | 36c6323ac13 |
15 | 1b41cc8a12b |
hex | eb2e69de21 |
1010096004641 has 16 divisors (see below), whose sum is σ = 1023992918928. Its totient is φ = 996278304000.
The previous prime is 1010096004613. The next prime is 1010096004653. The reversal of 1010096004641 is 1464006900101.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 159597054016 + 850498950625 = 399496^2 + 922225^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010096004641 - 214 = 1010095988257 is a prime.
It is a super-2 number, since 2×10100960046412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010096004598 and 1010096004607.
It is not an unprimeable number, because it can be changed into a prime (1010096004601) 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, 95313755 + ... + 95324351.
It is an arithmetic number, because the mean of its divisors is an integer number (63999557433).
Almost surely, 21010096004641 is an apocalyptic number.
It is an amenable number.
1010096004641 is a deficient number, since it is larger than the sum of its proper divisors (13896914287).
1010096004641 is a wasteful number, since it uses less digits than its factorization.
1010096004641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14212.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 1010096004641 in words is "one trillion, ten billion, ninety-six million, four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •