Base | Representation |
---|---|
bin | 10111110111111101110011… |
… | …100110101101000001101011 |
3 | 111202202222221120112111200102 |
4 | 113313331303212231001223 |
5 | 102230314024240323201 |
6 | 1011152443520100015 |
7 | 31055033534305652 |
oct | 2767756346550153 |
9 | 452688846474612 |
10 | 105001005011051 |
11 | 30502748a5a386 |
12 | b939a9416460b |
13 | 46787244b01b6 |
14 | 1bd010bc4c199 |
15 | c214b536226b |
hex | 5f7f739ad06b |
105001005011051 has 8 divisors (see below), whose sum is σ = 110630016257280. Its totient is φ = 99460639611432.
The previous prime is 105001005011017. The next prime is 105001005011053. The reversal of 105001005011051 is 150110500100501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105001005011051 - 242 = 100602958499947 is a prime.
It is a super-2 number, since 2×1050010050110512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105001005011053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22161459221 + ... + 22161463958.
It is an arithmetic number, because the mean of its divisors is an integer number (13828752032160).
Almost surely, 2105001005011051 is an apocalyptic number.
105001005011051 is a deficient number, since it is larger than the sum of its proper divisors (5629011246229).
105001005011051 is a wasteful number, since it uses less digits than its factorization.
105001005011051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44322923305.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 105001005011051 its reverse (150110500100501), we get a palindrome (255111505111552).
The spelling of 105001005011051 in words is "one hundred five trillion, one billion, five million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •