Base | Representation |
---|---|
bin | 11110000010011000010111… |
… | …100110011001110001001011 |
3 | 122022202010002120221111022011 |
4 | 132002120113212121301023 |
5 | 114303402020002031410 |
6 | 1144544111010040351 |
7 | 36553162023601666 |
oct | 3602302746316113 |
9 | 568663076844264 |
10 | 132105000033355 |
11 | 39102463604188 |
12 | 12996a012790b7 |
13 | 58935a9499abb |
14 | 2489cb7b7c6dd |
15 | 104154a72218a |
hex | 782617999c4b |
132105000033355 has 4 divisors (see below), whose sum is σ = 158526000040032. Its totient is φ = 105684000026680.
The previous prime is 132105000033341. The next prime is 132105000033449. The reversal of 132105000033355 is 553330000501231.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 132105000033355 - 211 = 132105000031307 is a prime.
It is a super-2 number, since 2×1321050000333552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13210500003331 + ... + 13210500003340.
It is an arithmetic number, because the mean of its divisors is an integer number (39631500010008).
Almost surely, 2132105000033355 is an apocalyptic number.
132105000033355 is a deficient number, since it is larger than the sum of its proper divisors (26421000006677).
132105000033355 is an equidigital number, since it uses as much as digits as its factorization.
132105000033355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26421000006676.
The product of its (nonzero) digits is 20250, while the sum is 31.
Adding to 132105000033355 its reverse (553330000501231), we get a palindrome (685435000534586).
The spelling of 132105000033355 in words is "one hundred thirty-two trillion, one hundred five billion, thirty-three thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •