Base | Representation |
---|---|
bin | 11110010011001100100010… |
… | …010001100011101101100111 |
3 | 122110211120201010122010111020 |
4 | 132103030202101203231213 |
5 | 114431320023440233223 |
6 | 1151231012403142223 |
7 | 40032520021514550 |
oct | 3623144221435547 |
9 | 573746633563436 |
10 | 133260525321063 |
11 | 395085204a36a8 |
12 | 12b42948374973 |
13 | 594854b9408aa |
14 | 24c9bb56d3327 |
15 | 106162ab801e3 |
hex | 793322463b67 |
133260525321063 has 32 divisors (see below), whose sum is σ = 204840401633280. Its totient is φ = 75483634514400.
The previous prime is 133260525321061. The next prime is 133260525321097. The reversal of 133260525321063 is 360123525062331.
133260525321063 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 133260525321063 - 21 = 133260525321061 is a prime.
It is a super-3 number, since 3×1332605253210633 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133260525321061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18635953 + ... + 24775386.
It is an arithmetic number, because the mean of its divisors is an integer number (6401262551040).
Almost surely, 2133260525321063 is an apocalyptic number.
133260525321063 is a deficient number, since it is larger than the sum of its proper divisors (71579876312217).
133260525321063 is a wasteful number, since it uses less digits than its factorization.
133260525321063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43412627.
The product of its (nonzero) digits is 583200, while the sum is 42.
The spelling of 133260525321063 in words is "one hundred thirty-three trillion, two hundred sixty billion, five hundred twenty-five million, three hundred twenty-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •