Base | Representation |
---|---|
bin | 11000100100100110010011… |
… | …011110000011100110100111 |
3 | 112011122012202220220211221202 |
4 | 120210212103132003212213 |
5 | 103131042030420430422 |
6 | 1021501453201433115 |
7 | 31522444256640443 |
oct | 3044462336034647 |
9 | 464565686824852 |
10 | 108068146264487 |
11 | 31485497265562 |
12 | 101543b763b79b |
13 | 483ba230cbc16 |
14 | 1c98751c03823 |
15 | c76179225b92 |
hex | 6249937839a7 |
108068146264487 has 4 divisors (see below), whose sum is σ = 110988906974376. Its totient is φ = 105147385554600.
The previous prime is 108068146264459. The next prime is 108068146264499. The reversal of 108068146264487 is 784462641860801.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 108068146264487 - 230 = 108067072522663 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108068146264457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1460380354889 + ... + 1460380354962.
It is an arithmetic number, because the mean of its divisors is an integer number (27747226743594).
Almost surely, 2108068146264487 is an apocalyptic number.
108068146264487 is a deficient number, since it is larger than the sum of its proper divisors (2920760709889).
108068146264487 is an equidigital number, since it uses as much as digits as its factorization.
108068146264487 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2920760709888.
The product of its (nonzero) digits is 99090432, while the sum is 65.
The spelling of 108068146264487 in words is "one hundred eight trillion, sixty-eight billion, one hundred forty-six million, two hundred sixty-four thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •