Base | Representation |
---|---|
bin | 110100110001100110… |
… | …0010110110101111001 |
3 | 101211112101122212010112 |
4 | 1221203030112311321 |
5 | 3324101313131434 |
6 | 124021542354105 |
7 | 11121335303354 |
oct | 1514314266571 |
9 | 354471585115 |
10 | 113333333369 |
11 | 44078791883 |
12 | 19b6b12b935 |
13 | a8c1c80509 |
14 | 56b1b9929b |
15 | 2e34a81dce |
hex | 1a63316d79 |
113333333369 has 2 divisors, whose sum is σ = 113333333370. Its totient is φ = 113333333368.
The previous prime is 113333333357. The next prime is 113333333371. The reversal of 113333333369 is 963333333311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98478598969 + 14854734400 = 313813^2 + 121880^2 .
It is an emirp because it is prime and its reverse (963333333311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113333333369 is a prime.
It is a super-2 number, since 2×1133333333692 (a number of 23 digits) contains 22 as substring.
Together with 113333333371, it forms a pair of twin primes.
It is a Chen prime.
It is a plaindrome in base 10.
It is not a weakly prime, because it can be changed into another prime (113333333569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56666666684 + 56666666685.
It is an arithmetic number, because the mean of its divisors is an integer number (56666666685).
Almost surely, 2113333333369 is an apocalyptic number.
It is an amenable number.
113333333369 is a deficient number, since it is larger than the sum of its proper divisors (1).
113333333369 is an equidigital number, since it uses as much as digits as its factorization.
113333333369 is an evil number, because the sum of its binary digits is even.
The product of its digits is 354294, while the sum is 41.
The spelling of 113333333369 in words is "one hundred thirteen billion, three hundred thirty-three million, three hundred thirty-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •