Base | Representation |
---|---|
bin | 111101111111011000… |
… | …0110111110111111001 |
3 | 110201121120212110021111 |
4 | 1323332300313313321 |
5 | 4140114022243023 |
6 | 141053405040321 |
7 | 12421626620401 |
oct | 1737660676771 |
9 | 421546773244 |
10 | 133123243513 |
11 | 51503667217 |
12 | 219728560a1 |
13 | c726c7a410 |
14 | 662c1d3801 |
15 | 36e214e00d |
hex | 1efec37df9 |
133123243513 has 16 divisors (see below), whose sum is σ = 145126290960. Its totient is φ = 121379457024.
The previous prime is 133123243399. The next prime is 133123243529. The reversal of 133123243513 is 315342321331.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1188663529 + 131934579984 = 34477^2 + 363228^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133123243513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133123243543) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 275773 + ... + 585061.
It is an arithmetic number, because the mean of its divisors is an integer number (9070393185).
Almost surely, 2133123243513 is an apocalyptic number.
133123243513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
133123243513 is a deficient number, since it is larger than the sum of its proper divisors (12003047447).
133123243513 is a wasteful number, since it uses less digits than its factorization.
133123243513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309708.
The product of its digits is 19440, while the sum is 31.
Adding to 133123243513 its reverse (315342321331), we get a palindrome (448465564844).
The spelling of 133123243513 in words is "one hundred thirty-three billion, one hundred twenty-three million, two hundred forty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •