Base | Representation |
---|---|
bin | 11000111101100011011011… |
… | …001000010001000110110101 |
3 | 112101201011012211220100220020 |
4 | 120331203123020101012311 |
5 | 103342141131324311120 |
6 | 1025253344343555353 |
7 | 32060364041056230 |
oct | 3075433310210665 |
9 | 471634184810806 |
10 | 109783040463285 |
11 | 31a867a9338052 |
12 | 1039083215bb59 |
13 | 493465b488577 |
14 | 1d177556b4417 |
15 | ca5a9740a640 |
hex | 63d8db2111b5 |
109783040463285 has 64 divisors (see below), whose sum is σ = 213115558809600. Its totient is φ = 47109754524672.
The previous prime is 109783040463269. The next prime is 109783040463329. The reversal of 109783040463285 is 582364040387901.
It is not a de Polignac number, because 109783040463285 - 24 = 109783040463269 is a prime.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 80462145 + ... + 81815174.
It is an arithmetic number, because the mean of its divisors is an integer number (3329930606400).
It is a 1-persistent number, because it is pandigital, but 2⋅109783040463285 = 219566080926570 is not.
Almost surely, 2109783040463285 is an apocalyptic number.
109783040463285 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
109783040463285 is a deficient number, since it is larger than the sum of its proper divisors (103332518346315).
109783040463285 is a wasteful number, since it uses less digits than its factorization.
109783040463285 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162277730.
The product of its (nonzero) digits is 34836480, while the sum is 60.
The spelling of 109783040463285 in words is "one hundred nine trillion, seven hundred eighty-three billion, forty million, four hundred sixty-three thousand, two hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •