Base | Representation |
---|---|
bin | 11110010110001000010100… |
… | …111000010001101010100001 |
3 | 122111112212011200111000002210 |
4 | 132112020110320101222201 |
5 | 114443121002444141031 |
6 | 1151503401033032333 |
7 | 40053215561454624 |
oct | 3626102470215241 |
9 | 574485150430083 |
10 | 133462164052641 |
11 | 39585a93290116 |
12 | 12b75a408556a9 |
13 | 5961574606c08 |
14 | 24d58632abdbb |
15 | 10669cce04746 |
hex | 796214e11aa1 |
133462164052641 has 16 divisors (see below), whose sum is σ = 180391167624960. Its totient is φ = 87756331877760.
The previous prime is 133462164052621. The next prime is 133462164052661. The reversal of 133462164052641 is 146250461264331.
It is an interprime number because it is at equal distance from previous prime (133462164052621) and next prime (133462164052661).
It is not a de Polignac number, because 133462164052641 - 210 = 133462164051617 is a prime.
It is a super-2 number, since 2×1334621640526412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133462164052621) 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, 295226130 + ... + 295677851.
It is an arithmetic number, because the mean of its divisors is an integer number (11274447976560).
Almost surely, 2133462164052641 is an apocalyptic number.
It is an amenable number.
133462164052641 is a deficient number, since it is larger than the sum of its proper divisors (46929003572319).
133462164052641 is an equidigital number, since it uses as much as digits as its factorization.
133462164052641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 590905016.
The product of its (nonzero) digits is 2488320, while the sum is 48.
The spelling of 133462164052641 in words is "one hundred thirty-three trillion, four hundred sixty-two billion, one hundred sixty-four million, fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •