Base | Representation |
---|---|
bin | 11000111100000111010100… |
… | …111001011010101111000011 |
3 | 112101100200222010011122020101 |
4 | 120330013110321122233003 |
5 | 103334031120311100314 |
6 | 1025140111553423231 |
7 | 32050263346104556 |
oct | 3074072471325703 |
9 | 471320863148211 |
10 | 109684151659459 |
11 | 31a488731740a3 |
12 | 1037563456ab17 |
13 | 492822bc49970 |
14 | 1d12a5406869d |
15 | ca320aa19174 |
hex | 63c1d4e5abc3 |
109684151659459 has 16 divisors (see below), whose sum is σ = 118148573198880. Its totient is φ = 101223615398400.
The previous prime is 109684151659447. The next prime is 109684151659559. The reversal of 109684151659459 is 954956151486901.
It is a cyclic number.
It is not a de Polignac number, because 109684151659459 - 25 = 109684151659427 is a prime.
It is a super-2 number, since 2×1096841516594592 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 109684151659391 and 109684151659400.
It is not an unprimeable number, because it can be changed into a prime (109684151659559) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1299517659 + ... + 1299602059.
It is an arithmetic number, because the mean of its divisors is an integer number (7384285824930).
Almost surely, 2109684151659459 is an apocalyptic number.
109684151659459 is a deficient number, since it is larger than the sum of its proper divisors (8464421539421).
109684151659459 is a wasteful number, since it uses less digits than its factorization.
109684151659459 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106230.
The product of its (nonzero) digits is 419904000, while the sum is 73.
The spelling of 109684151659459 in words is "one hundred nine trillion, six hundred eighty-four billion, one hundred fifty-one million, six hundred fifty-nine thousand, four hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •