Base | Representation |
---|---|
bin | 10011001101011110000… |
… | …001010011011111010111 |
3 | 11200012111021221022110201 |
4 | 103031132001103133113 |
5 | 133112112341011101 |
6 | 2450243242001331 |
7 | 164243052626053 |
oct | 23153601233727 |
9 | 4605437838421 |
10 | 1320132360151 |
11 | 469957335370 |
12 | 193a257a6247 |
13 | 97646035b97 |
14 | 47c75286c63 |
15 | 245165d8e01 |
hex | 1335e0537d7 |
1320132360151 has 16 divisors (see below), whose sum is σ = 1513570625280. Its totient is φ = 1139682582720.
The previous prime is 1320132360139. The next prime is 1320132360199. The reversal of 1320132360151 is 1510632310231.
It is a happy number.
It is not a de Polignac number, because 1320132360151 - 215 = 1320132327383 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 (1320132360101) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 18734310 + ... + 18804643.
It is an arithmetic number, because the mean of its divisors is an integer number (94598164080).
Almost surely, 21320132360151 is an apocalyptic number.
1320132360151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1320132360151 is a deficient number, since it is larger than the sum of its proper divisors (193438265129).
1320132360151 is a wasteful number, since it uses less digits than its factorization.
1320132360151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37539126.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 1320132360151 its reverse (1510632310231), we get a palindrome (2830764670382).
The spelling of 1320132360151 in words is "one trillion, three hundred twenty billion, one hundred thirty-two million, three hundred sixty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •