Base | Representation |
---|---|
bin | 101101100101111100100… |
… | …000101100101101100010 |
3 | 102002112010112020021221000 |
4 | 231211330200230231202 |
5 | 402313112221332224 |
6 | 10355200245212430 |
7 | 442234431324303 |
oct | 55457440545542 |
9 | 12075115207830 |
10 | 3133120105314 |
11 | aa882668a141 |
12 | 427277701116 |
13 | 1995b4c4baa4 |
14 | ab9029107aa |
15 | 567764730c9 |
hex | 2d97c82cb62 |
3133120105314 has 32 divisors (see below), whose sum is σ = 7187085550080. Its totient is φ = 1010683904400.
The previous prime is 3133120105273. The next prime is 3133120105327. The reversal of 3133120105314 is 4135010213313.
3133120105314 is a `hidden beast` number, since 3 + 1 + 3 + 3 + 120 + 1 + 0 + 531 + 4 = 666.
3133120105314 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 935816757 + ... + 935820104.
It is an arithmetic number, because the mean of its divisors is an integer number (224596423440).
Almost surely, 23133120105314 is an apocalyptic number.
3133120105314 is an abundant number, since it is smaller than the sum of its proper divisors (4053965444766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3133120105314 is a wasteful number, since it uses less digits than its factorization.
3133120105314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871636903 (or 1871636897 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 3133120105314 its reverse (4135010213313), we get a palindrome (7268130318627).
The spelling of 3133120105314 in words is "three trillion, one hundred thirty-three billion, one hundred twenty million, one hundred five thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •