Base | Representation |
---|---|
bin | 11010011001100100010010… |
… | …000010011010110000100001 |
3 | 120020002122021110200201110221 |
4 | 122121210102002122300201 |
5 | 110204240400301132140 |
6 | 1050534233001323041 |
7 | 33312251502304234 |
oct | 3231442202326041 |
9 | 506078243621427 |
10 | 116106153536545 |
11 | 33aa4385876837 |
12 | 11032197a96481 |
13 | 4ca29bcc76273 |
14 | 20957d412941b |
15 | d652c2c4a14a |
hex | 69991209ac21 |
116106153536545 has 8 divisors (see below), whose sum is σ = 139604377058496. Its totient is φ = 92700260952816.
The previous prime is 116106153536509. The next prime is 116106153536567. The reversal of 116106153536545 is 545635351601611.
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 116106153536545 - 213 = 116106153528353 is a prime.
It is a super-2 number, since 2×1161061535365452 (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 = 116106153536492 and 116106153536501.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23082731787 + ... + 23082736816.
It is an arithmetic number, because the mean of its divisors is an integer number (17450547132312).
Almost surely, 2116106153536545 is an apocalyptic number.
It is an amenable number.
116106153536545 is a deficient number, since it is larger than the sum of its proper divisors (23498223521951).
116106153536545 is an equidigital number, since it uses as much as digits as its factorization.
116106153536545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46165469111.
The product of its (nonzero) digits is 4860000, while the sum is 52.
The spelling of 116106153536545 in words is "one hundred sixteen trillion, one hundred six billion, one hundred fifty-three million, five hundred thirty-six thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •