Base | Representation |
---|---|
bin | 10111110111111101110011… |
… | …010011110100100010001001 |
3 | 111202202222221020020000120121 |
4 | 113313331303103310202021 |
5 | 102230314022003423230 |
6 | 1011152443222023241 |
7 | 31055033444241343 |
oct | 2767756323644211 |
9 | 452688836200517 |
10 | 105001000061065 |
11 | 30502746189389 |
12 | b939a92577b21 |
13 | 4678723469104 |
14 | 1bd010b320293 |
15 | c214b4bd577a |
hex | 5f7f734f4889 |
105001000061065 has 8 divisors (see below), whose sum is σ = 126001289713608. Its totient is φ = 84000740288640.
The previous prime is 105001000061059. The next prime is 105001000061101. The reversal of 105001000061065 is 560160000100501.
It can be written as a sum of positive squares in 4 ways, for example, as 16034546627856 + 88966453433209 = 4004316^2 + 9432203^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105001000061065 - 23 = 105001000061057 is a prime.
It is a super-2 number, since 2×1050010000610652 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1169269 + ... + 14538541.
It is an arithmetic number, because the mean of its divisors is an integer number (15750161214201).
Almost surely, 2105001000061065 is an apocalyptic number.
It is an amenable number.
105001000061065 is a deficient number, since it is larger than the sum of its proper divisors (21000289652543).
105001000061065 is a wasteful number, since it uses less digits than its factorization.
105001000061065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14940059.
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 105001000061065 its reverse (560160000100501), we get a palindrome (665161000161566).
The spelling of 105001000061065 in words is "one hundred five trillion, one billion, sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •