Base | Representation |
---|---|
bin | 1111111100101… |
… | …01011101110011 |
3 | 100022201210112022 |
4 | 13332111131303 |
5 | 233222000423 |
6 | 21135222055 |
7 | 3213060062 |
oct | 776253563 |
9 | 308653468 |
10 | 133781363 |
11 | 69574a11 |
12 | 3897792b |
13 | 21940991 |
14 | 13aa61d9 |
15 | bb28dc8 |
hex | 7f95773 |
133781363 has 4 divisors (see below), whose sum is σ = 139597968. Its totient is φ = 127964760.
The previous prime is 133781359. The next prime is 133781371. The reversal of 133781363 is 363187331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133781363 - 22 = 133781359 is a prime.
It is a super-2 number, since 2×1337813632 = 35794906172275538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133781353) 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 3 ways as a sum of consecutive naturals, for example, 2908268 + ... + 2908313.
It is an arithmetic number, because the mean of its divisors is an integer number (34899492).
Almost surely, 2133781363 is an apocalyptic number.
133781363 is a deficient number, since it is larger than the sum of its proper divisors (5816605).
133781363 is an equidigital number, since it uses as much as digits as its factorization.
133781363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5816604.
The product of its digits is 27216, while the sum is 35.
The square root of 133781363 is about 11566.3893674733. The cubic root of 133781363 is about 511.4445307982. Note that the first 3 decimals are identical.
It can be divided in two parts, 13378 and 1363, that added together give a palindrome (14741).
The spelling of 133781363 in words is "one hundred thirty-three million, seven hundred eighty-one thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •