Base | Representation |
---|---|
bin | 11000010000101110111010… |
… | …100011001101000011100101 |
3 | 111222210201002200202101212021 |
4 | 120100232322203031003211 |
5 | 102441210222043401341 |
6 | 1014534403233223141 |
7 | 31322015603625631 |
oct | 3020567243150345 |
9 | 458721080671767 |
10 | 106703002325221 |
11 | 30aa9542086635 |
12 | bb7390b701ab1 |
13 | 477008595c673 |
14 | 1c4c64a955dc1 |
15 | c508cb1b29d1 |
hex | 610bba8cd0e5 |
106703002325221 has 8 divisors (see below), whose sum is σ = 107359559807360. Its totient is φ = 106046468475552.
The previous prime is 106703002325119. The next prime is 106703002325237. The reversal of 106703002325221 is 122523200307601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106703002325221 is a prime.
It is a super-2 number, since 2×1067030023252212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106703002325321) 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, 3192865 + ... + 14953273.
It is an arithmetic number, because the mean of its divisors is an integer number (13419944975920).
Almost surely, 2106703002325221 is an apocalyptic number.
It is an amenable number.
106703002325221 is a deficient number, since it is larger than the sum of its proper divisors (656557482139).
106703002325221 is a wasteful number, since it uses less digits than its factorization.
106703002325221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11816235.
The product of its (nonzero) digits is 30240, while the sum is 34.
The spelling of 106703002325221 in words is "one hundred six trillion, seven hundred three billion, two million, three hundred twenty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •