Base | Representation |
---|---|
bin | 11110010111001000110000… |
… | …110101011011000100110111 |
3 | 122111210110202112211111202212 |
4 | 132113020300311123010313 |
5 | 120000234202222343133 |
6 | 1151555242334324035 |
7 | 40061215253104553 |
oct | 3627106065330467 |
9 | 574713675744685 |
10 | 133531352543543 |
11 | 396023683a0409 |
12 | 12b8732b95961b |
13 | 5967c4c89bc66 |
14 | 24d8d48200863 |
15 | 10686cc168148 |
hex | 797230d5b137 |
133531352543543 has 16 divisors (see below), whose sum is σ = 135108926412096. Its totient is φ = 131959384381440.
The previous prime is 133531352543521. The next prime is 133531352543581. The reversal of 133531352543543 is 345345253135331.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 133531352543543 - 212 = 133531352539447 is a prime.
It is a super-2 number, since 2×1335313525435432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133531352543491 and 133531352543500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133531352543503) 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, 136847555 + ... + 137819867.
It is an arithmetic number, because the mean of its divisors is an integer number (8444307900756).
Almost surely, 2133531352543543 is an apocalyptic number.
133531352543543 is a deficient number, since it is larger than the sum of its proper divisors (1577573868553).
133531352543543 is a wasteful number, since it uses less digits than its factorization.
133531352543543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975194.
The product of its digits is 14580000, while the sum is 50.
The spelling of 133531352543543 in words is "one hundred thirty-three trillion, five hundred thirty-one billion, three hundred fifty-two million, five hundred forty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •