Base | Representation |
---|---|
bin | 11110010101100011000010… |
… | …010101010000001001011101 |
3 | 122111102000211020212122001201 |
4 | 132111203002111100021131 |
5 | 114441442002323342023 |
6 | 1151433140001035501 |
7 | 40050300423354622 |
oct | 3625430225201135 |
9 | 574360736778051 |
10 | 133422124434013 |
11 | 39570006a32008 |
12 | 12b6a127625b91 |
13 | 595a86329259c |
14 | 24d394574a349 |
15 | 1065937be3bad |
hex | 7958c255025d |
133422124434013 has 8 divisors (see below), whose sum is σ = 136280440195200. Its totient is φ = 130564623137760.
The previous prime is 133422124433947. The next prime is 133422124434017. The reversal of 133422124434013 is 310434421224331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133422124434013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133422124434017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203285088 + ... + 203940361.
It is an arithmetic number, because the mean of its divisors is an integer number (17035055024400).
Almost surely, 2133422124434013 is an apocalyptic number.
It is an amenable number.
133422124434013 is a deficient number, since it is larger than the sum of its proper divisors (2858315761187).
133422124434013 is an equidigital number, since it uses as much as digits as its factorization.
133422124434013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407232467.
The product of its (nonzero) digits is 165888, while the sum is 37.
Adding to 133422124434013 its reverse (310434421224331), we get a palindrome (443856545658344).
The spelling of 133422124434013 in words is "one hundred thirty-three trillion, four hundred twenty-two billion, one hundred twenty-four million, four hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •