Base | Representation |
---|---|
bin | 11110000100100010111010… |
… | …110000010111011100110000 |
3 | 122100021100002100202202211210 |
4 | 132010202322300113130300 |
5 | 114313321203123011233 |
6 | 1145140312541440120 |
7 | 36600006421403340 |
oct | 3604427260273460 |
9 | 570240070682753 |
10 | 132253766219568 |
11 | 3915a564200814 |
12 | 129bb7ba870040 |
13 | 58a4627245c16 |
14 | 249318b71ad20 |
15 | 1045355d37163 |
hex | 7848bac17730 |
132253766219568 has 80 divisors (see below), whose sum is σ = 411014210827520. Its totient is φ = 35798011907328.
The previous prime is 132253766219567. The next prime is 132253766219599. The reversal of 132253766219568 is 865912667352231.
It is a super-2 number, since 2×1322537662195682 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132253766219499 and 132253766219508.
It is not an unprimeable number, because it can be changed into a prime (132253766219563) 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, 10358214655 + ... + 10358227422.
It is an arithmetic number, because the mean of its divisors is an integer number (5137677635344).
Almost surely, 2132253766219568 is an apocalyptic number.
It is an amenable number.
132253766219568 is an abundant number, since it is smaller than the sum of its proper divisors (278760444607952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132253766219568 is a wasteful number, since it uses less digits than its factorization.
132253766219568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20716442114 (or 20716442108 counting only the distinct ones).
The product of its digits is 195955200, while the sum is 66.
The spelling of 132253766219568 in words is "one hundred thirty-two trillion, two hundred fifty-three billion, seven hundred sixty-six million, two hundred nineteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •