Base | Representation |
---|---|
bin | 1101111000001… |
… | …11010110011001 |
3 | 22010001212000110 |
4 | 12330013112121 |
5 | 214301001131 |
6 | 15315154533 |
7 | 2612366601 |
oct | 674072631 |
9 | 263055013 |
10 | 116422041 |
11 | 5a79866a |
12 | 32ba5a49 |
13 | 1b1734a8 |
14 | 11667c01 |
15 | a34a646 |
hex | 6f07599 |
116422041 has 4 divisors (see below), whose sum is σ = 155229392. Its totient is φ = 77614692.
The previous prime is 116422013. The next prime is 116422051. The reversal of 116422041 is 140224611.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 140224611 = 3 ⋅46741537.
It is not a de Polignac number, because 116422041 - 27 = 116421913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116421999 and 116422017.
It is not an unprimeable number, because it can be changed into a prime (116422051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19403671 + ... + 19403676.
It is an arithmetic number, because the mean of its divisors is an integer number (38807348).
Almost surely, 2116422041 is an apocalyptic number.
It is an amenable number.
116422041 is a deficient number, since it is larger than the sum of its proper divisors (38807351).
116422041 is an equidigital number, since it uses as much as digits as its factorization.
116422041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38807350.
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 116422041 is about 10789.9045871592. The cubic root of 116422041 is about 488.2906439041.
Adding to 116422041 its reverse (140224611), we get a palindrome (256646652).
The spelling of 116422041 in words is "one hundred sixteen million, four hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •