Base | Representation |
---|---|
bin | 1110011110111… |
… | …10000011110001 |
3 | 22110121121220012 |
4 | 13033132003301 |
5 | 222100331133 |
6 | 20020024305 |
7 | 3003461066 |
oct | 717360361 |
9 | 273547805 |
10 | 121495793 |
11 | 62643651 |
12 | 34832095 |
13 | 1c22ba03 |
14 | 121c8c6d |
15 | a9edb48 |
hex | 73de0f1 |
121495793 has 2 divisors, whose sum is σ = 121495794. Its totient is φ = 121495792.
The previous prime is 121495783. The next prime is 121495817. The reversal of 121495793 is 397594121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97456384 + 24039409 = 9872^2 + 4903^2 .
It is an emirp because it is prime and its reverse (397594121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121495793 - 28 = 121495537 is a prime.
It is a super-2 number, since 2×1214957932 = 29522455433397698, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 121495793.
It is not a weakly prime, because it can be changed into another prime (121495763) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60747896 + 60747897.
It is an arithmetic number, because the mean of its divisors is an integer number (60747897).
Almost surely, 2121495793 is an apocalyptic number.
It is an amenable number.
121495793 is a deficient number, since it is larger than the sum of its proper divisors (1).
121495793 is an equidigital number, since it uses as much as digits as its factorization.
121495793 is an evil number, because the sum of its binary digits is even.
The product of its digits is 68040, while the sum is 41.
The square root of 121495793 is about 11022.5130074770. The cubic root of 121495793 is about 495.2833707217.
The spelling of 121495793 in words is "one hundred twenty-one million, four hundred ninety-five thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •