Base | Representation |
---|---|
bin | 101101111110111111111… |
… | …000001111101011111101 |
3 | 102012002120020102102002110 |
4 | 231332333320033223331 |
5 | 403233210124431013 |
6 | 10415405422444233 |
7 | 444206150063442 |
oct | 55767770175375 |
9 | 12162506372073 |
10 | 3160020155133 |
11 | 100917aaa5776 |
12 | 430524433679 |
13 | 19bcb100572a |
14 | acd353759c9 |
15 | 572ecd632c3 |
hex | 2dfbfe0fafd |
3160020155133 has 32 divisors (see below), whose sum is σ = 4259769062400. Its totient is φ = 2083635671040.
The previous prime is 3160020155113. The next prime is 3160020155141. The reversal of 3160020155133 is 3315510200613.
It is not a de Polignac number, because 3160020155133 - 28 = 3160020154877 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3160020155133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3160020155113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75312666 + ... + 75354612.
It is an arithmetic number, because the mean of its divisors is an integer number (133117783200).
Almost surely, 23160020155133 is an apocalyptic number.
It is an amenable number.
3160020155133 is a deficient number, since it is larger than the sum of its proper divisors (1099748907267).
3160020155133 is a wasteful number, since it uses less digits than its factorization.
3160020155133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42897.
The product of its (nonzero) digits is 8100, while the sum is 30.
Adding to 3160020155133 its reverse (3315510200613), we get a palindrome (6475530355746).
The spelling of 3160020155133 in words is "three trillion, one hundred sixty billion, twenty million, one hundred fifty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •