Base | Representation |
---|---|
bin | 10011001101011100111… |
… | …100010000100010010000 |
3 | 11200012110000212201212220 |
4 | 103031130330100202100 |
5 | 133112043222310422 |
6 | 2450241354021040 |
7 | 164242443032214 |
oct | 23153474204220 |
9 | 4605400781786 |
10 | 1320114260112 |
11 | 4699480a255a |
12 | 193a1b717780 |
13 | 976423694bb |
14 | 47c72ad4944 |
15 | 24514c10e5c |
hex | 1335cf10890 |
1320114260112 has 40 divisors (see below), whose sum is σ = 3468096792480. Its totient is φ = 432579813120.
The previous prime is 1320114260041. The next prime is 1320114260159. The reversal of 1320114260112 is 2110624110231.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 233068189 + ... + 233073852.
It is an arithmetic number, because the mean of its divisors is an integer number (86702419812).
Almost surely, 21320114260112 is an apocalyptic number.
1320114260112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1320114260112 is an abundant number, since it is smaller than the sum of its proper divisors (2147982532368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320114260112 is a wasteful number, since it uses less digits than its factorization.
1320114260112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466142111 (or 466142105 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 1320114260112 its reverse (2110624110231), we get a palindrome (3430738370343).
The spelling of 1320114260112 in words is "one trillion, three hundred twenty billion, one hundred fourteen million, two hundred sixty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •