Base | Representation |
---|---|
bin | 11110000011000010111001… |
… | …001110111011110100111001 |
3 | 122022220110221210222110202011 |
4 | 132003002321032323310321 |
5 | 114310124023313311403 |
6 | 1145021101545005521 |
7 | 36556366404420421 |
oct | 3603027116736471 |
9 | 568813853873664 |
10 | 132150661463353 |
11 | 3911a865265395 |
12 | 129a38251838a1 |
13 | 58979a5434630 |
14 | 248c1aa1c5481 |
15 | 104281e264a6d |
hex | 7830b93bbd39 |
132150661463353 has 16 divisors (see below), whose sum is σ = 142346612169216. Its totient is φ = 121959072714240.
The previous prime is 132150661463299. The next prime is 132150661463369. The reversal of 132150661463353 is 353364166051231.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132150661463353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132150661463297 and 132150661463306.
It is not an unprimeable number, because it can be changed into a prime (132150661463153) 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, 1534611768 + ... + 1534697878.
It is an arithmetic number, because the mean of its divisors is an integer number (8896663260576).
Almost surely, 2132150661463353 is an apocalyptic number.
132150661463353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
132150661463353 is a deficient number, since it is larger than the sum of its proper divisors (10195950705863).
132150661463353 is a wasteful number, since it uses less digits than its factorization.
132150661463353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110064.
The product of its (nonzero) digits is 3499200, while the sum is 49.
The spelling of 132150661463353 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred sixty-one million, four hundred sixty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •