Base | Representation |
---|---|
bin | 11110000011000101010100… |
… | …001001100001101101000011 |
3 | 122022220201122221112221010111 |
4 | 132003011110021201231003 |
5 | 114310144334142422430 |
6 | 1145022211511412151 |
7 | 36556520664116041 |
oct | 3603052411415503 |
9 | 568821587487114 |
10 | 132153260514115 |
11 | 39120979371725 |
12 | 129a422b684057 |
13 | 5897ccaa344a9 |
14 | 248c37545b391 |
15 | 1042922508c2a |
hex | 783154261b43 |
132153260514115 has 4 divisors (see below), whose sum is σ = 158583912616944. Its totient is φ = 105722608411288.
The previous prime is 132153260514091. The next prime is 132153260514139. The reversal of 132153260514115 is 511415062351231.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (132153260514091) and next prime (132153260514139).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132153260514115 is a prime.
It is a super-2 number, since 2×1321532605141152 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13215326051407 + ... + 13215326051416.
It is an arithmetic number, because the mean of its divisors is an integer number (39645978154236).
Almost surely, 2132153260514115 is an apocalyptic number.
132153260514115 is a deficient number, since it is larger than the sum of its proper divisors (26430652102829).
132153260514115 is an equidigital number, since it uses as much as digits as its factorization.
132153260514115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26430652102828.
The product of its (nonzero) digits is 108000, while the sum is 40.
The spelling of 132153260514115 in words is "one hundred thirty-two trillion, one hundred fifty-three billion, two hundred sixty million, five hundred fourteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •