Base | Representation |
---|---|
bin | 11110000100100000111101… |
… | …100001101111010010100111 |
3 | 122100021010122221101121011210 |
4 | 132010200331201233102213 |
5 | 114313302402244424223 |
6 | 1145135324250202503 |
7 | 36566603360330265 |
oct | 3604407541572247 |
9 | 570233587347153 |
10 | 132251665233063 |
11 | 39159686259532 |
12 | 129bb313123433 |
13 | 58a4380ba103c |
14 | 249302c695435 |
15 | 1045281677893 |
hex | 78483d86f4a7 |
132251665233063 has 8 divisors (see below), whose sum is σ = 176461597648000. Its totient is φ = 88104754820088.
The previous prime is 132251665233031. The next prime is 132251665233067. The reversal of 132251665233063 is 360332566152231.
It is a happy number.
132251665233063 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132251665233063 - 25 = 132251665233031 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132251665233067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15755495593 + ... + 15755503986.
It is an arithmetic number, because the mean of its divisors is an integer number (22057699706000).
Almost surely, 2132251665233063 is an apocalyptic number.
132251665233063 is a deficient number, since it is larger than the sum of its proper divisors (44209932414937).
132251665233063 is a wasteful number, since it uses less digits than its factorization.
132251665233063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31511000981.
The product of its (nonzero) digits is 3499200, while the sum is 48.
The spelling of 132251665233063 in words is "one hundred thirty-two trillion, two hundred fifty-one billion, six hundred sixty-five million, two hundred thirty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •