Base | Representation |
---|---|
bin | 11000110001011000110001… |
… | …011011001110001010001001 |
3 | 112021202020011122011110000122 |
4 | 120301120301123032022021 |
5 | 103234441343212243201 |
6 | 1023413314044513025 |
7 | 31643105320314533 |
oct | 3061306133161211 |
9 | 467666148143018 |
10 | 108946969649801 |
11 | 317941721422a8 |
12 | 1027679b84b775 |
13 | 48a38694b619a |
14 | 1cc90c0940853 |
15 | c8de62569e1b |
hex | 6316316ce289 |
108946969649801 has 8 divisors (see below), whose sum is σ = 109958213878920. Its totient is φ = 107936551942912.
The previous prime is 108946969649783. The next prime is 108946969649863.
108946969649801 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 463183691776 + 108483785958025 = 680576^2 + 10415555^2 .
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 108946969649801 - 214 = 108946969633417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108946969648801) 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, 206365706 + ... + 206892963.
It is an arithmetic number, because the mean of its divisors is an integer number (13744776734865).
Almost surely, 2108946969649801 is an apocalyptic number.
It is an amenable number.
108946969649801 is a deficient number, since it is larger than the sum of its proper divisors (1011244229119).
108946969649801 is a wasteful number, since it uses less digits than its factorization.
108946969649801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413261115.
The product of its (nonzero) digits is 1451188224, while the sum is 80.
The spelling of 108946969649801 in words is "one hundred eight trillion, nine hundred forty-six billion, nine hundred sixty-nine million, six hundred forty-nine thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •