Base | Representation |
---|---|
bin | 11110010001011100010101… |
… | …000011010100011100011011 |
3 | 122110102001201121112012212210 |
4 | 132101130111003110130123 |
5 | 114422331302331303121 |
6 | 1151055405251010203 |
7 | 40021023262551246 |
oct | 3621342503243433 |
9 | 573361647465783 |
10 | 133140044400411 |
11 | 394714151237a4 |
12 | 12b23523599963 |
13 | 593a08ac217b9 |
14 | 24c402656025d |
15 | 105d42887e876 |
hex | 7917150d471b |
133140044400411 has 8 divisors (see below), whose sum is σ = 177520189239360. Its totient is φ = 88759964580872.
The previous prime is 133140044400371. The next prime is 133140044400413. The reversal of 133140044400411 is 114004440041331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133140044400411 - 29 = 133140044399899 is a prime.
It is not an unprimeable number, because it can be changed into a prime (133140044400413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11257401 + ... + 19824458.
It is an arithmetic number, because the mean of its divisors is an integer number (22190023654920).
Almost surely, 2133140044400411 is an apocalyptic number.
133140044400411 is a deficient number, since it is larger than the sum of its proper divisors (44380144838949).
133140044400411 is a wasteful number, since it uses less digits than its factorization.
133140044400411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32509705.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 133140044400411 its reverse (114004440041331), we get a palindrome (247144484441742).
The spelling of 133140044400411 in words is "one hundred thirty-three trillion, one hundred forty billion, forty-four million, four hundred thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •