Base | Representation |
---|---|
bin | 110100111011100001… |
… | …1110000001001011011 |
3 | 101212101121210200020111 |
4 | 1221313003300021123 |
5 | 3330242123401133 |
6 | 124115010105151 |
7 | 11132523226432 |
oct | 1516703601133 |
9 | 355347720214 |
10 | 113666622043 |
11 | 44229932567 |
12 | 1a04287b1b7 |
13 | a946035150 |
14 | 5704156119 |
15 | 2e53e691cd |
hex | 1a770f025b |
113666622043 has 8 divisors (see below), whose sum is σ = 122439699200. Its totient is φ = 104897757888.
The previous prime is 113666622001. The next prime is 113666622059. The reversal of 113666622043 is 340226666311.
It is a happy number.
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 113666622043 - 233 = 105076687451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113666621987 and 113666622005.
It is not an unprimeable number, because it can be changed into a prime (113666622743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 997098 + ... + 1105231.
It is an arithmetic number, because the mean of its divisors is an integer number (15304962400).
Almost surely, 2113666622043 is an apocalyptic number.
113666622043 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
113666622043 is a deficient number, since it is larger than the sum of its proper divisors (8773077157).
113666622043 is a wasteful number, since it uses less digits than its factorization.
113666622043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106501.
The product of its (nonzero) digits is 186624, while the sum is 40.
The spelling of 113666622043 in words is "one hundred thirteen billion, six hundred sixty-six million, six hundred twenty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •