Base | Representation |
---|---|
bin | 11110010110000010011101… |
… | …111010110011111100110001 |
3 | 122111112020221021020200210011 |
4 | 132112002131322303330301 |
5 | 114443020112023330421 |
6 | 1151500440511334521 |
7 | 40052603643562360 |
oct | 3626023572637461 |
9 | 574466837220704 |
10 | 133455873261361 |
11 | 395833552a5562 |
12 | 12b74785b21441 |
13 | 5960ab1215a01 |
14 | 24d5427a057d7 |
15 | 10667609cb4e1 |
hex | 79609deb3f31 |
133455873261361 has 8 divisors (see below), whose sum is σ = 152847595442880. Its totient is φ = 114145800437328.
The previous prime is 133455873261287. The next prime is 133455873261407. The reversal of 133455873261361 is 163162378554331.
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 133455873261361 - 29 = 133455873260849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133455873261296 and 133455873261305.
It is not an unprimeable number, because it can be changed into a prime (133455873211361) 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, 20412335866 + ... + 20412342403.
It is an arithmetic number, because the mean of its divisors is an integer number (19105949430360).
Almost surely, 2133455873261361 is an apocalyptic number.
It is an amenable number.
133455873261361 is a deficient number, since it is larger than the sum of its proper divisors (19391722181519).
133455873261361 is an equidigital number, since it uses as much as digits as its factorization.
133455873261361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40824678743.
The product of its digits is 32659200, while the sum is 58.
The spelling of 133455873261361 in words is "one hundred thirty-three trillion, four hundred fifty-five billion, eight hundred seventy-three million, two hundred sixty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •