Base | Representation |
---|---|
bin | 110001100001001110… |
… | …0101001011111101010 |
3 | 101011111010022011201100 |
4 | 1203002130221133222 |
5 | 3220241411130002 |
6 | 120504055302230 |
7 | 10453145610165 |
oct | 1430234513752 |
9 | 334433264640 |
10 | 106341505002 |
11 | 41110009727 |
12 | 1873967a976 |
13 | a049578b75 |
14 | 520b368adc |
15 | 2b75d2e11c |
hex | 18c27297ea |
106341505002 has 12 divisors (see below), whose sum is σ = 230406594210. Its totient is φ = 35447168328.
The previous prime is 106341504977. The next prime is 106341505003. The reversal of 106341505002 is 200505143601.
106341505002 is a `hidden beast` number, since 1 + 0 + 6 + 3 + 4 + 150 + 500 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 89609823801 + 16731681201 = 299349^2 + 129351^2 .
It is a super-2 number, since 2×1063415050022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106341505003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2953930677 + ... + 2953930712.
Almost surely, 2106341505002 is an apocalyptic number.
106341505002 is an abundant number, since it is smaller than the sum of its proper divisors (124065089208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106341505002 is a wasteful number, since it uses less digits than its factorization.
106341505002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5907861397 (or 5907861394 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 106341505002 its reverse (200505143601), we get a palindrome (306846648603).
The spelling of 106341505002 in words is "one hundred six billion, three hundred forty-one million, five hundred five thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •