Base | Representation |
---|---|
bin | 111101111111000001… |
… | …1110100001101001101 |
3 | 110201120202122100221112 |
4 | 1323332003310031031 |
5 | 4140103011311023 |
6 | 141052303541405 |
7 | 12421424334500 |
oct | 1737603641515 |
9 | 421522570845 |
10 | 133111432013 |
11 | 514a7a2a04a |
12 | 2196a8ba865 |
13 | c7246a3171 |
14 | 662a7db137 |
15 | 36e10b9478 |
hex | 1efe0f434d |
133111432013 has 12 divisors (see below), whose sum is σ = 158620593852. Its totient is φ = 111312694080.
The previous prime is 133111432007. The next prime is 133111432067. The reversal of 133111432013 is 310234111331.
It can be written as a sum of positive squares in 2 ways, for example, as 72212050729 + 60899381284 = 268723^2 + 246778^2 .
It is not a de Polignac number, because 133111432013 - 218 = 133111169869 is a 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 133111432013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133111432313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33126770 + ... + 33130787.
It is an arithmetic number, because the mean of its divisors is an integer number (13218382821).
Almost surely, 2133111432013 is an apocalyptic number.
It is an amenable number.
133111432013 is a deficient number, since it is larger than the sum of its proper divisors (25509161839).
133111432013 is an equidigital number, since it uses as much as digits as its factorization.
133111432013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66257612 (or 66257605 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 133111432013 its reverse (310234111331), we get a palindrome (443345543344).
The spelling of 133111432013 in words is "one hundred thirty-three billion, one hundred eleven million, four hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •