Base | Representation |
---|---|
bin | 1011101111010010… |
… | …0111010111100101 |
3 | 22010121102002122112 |
4 | 2323310213113211 |
5 | 22423142212013 |
6 | 1240403410405 |
7 | 141042116102 |
oct | 27364472745 |
9 | 8117362575 |
10 | 3151132133 |
11 | 1377806236 |
12 | 73b383a05 |
13 | 3b2abb836 |
14 | 21c707aa9 |
15 | 136998ba8 |
hex | bbd275e5 |
3151132133 has 6 divisors (see below), whose sum is σ = 3163228614. Its totient is φ = 3139081736.
The previous prime is 3151132129. The next prime is 3151132139. The reversal of 3151132133 is 3312311513.
It can be written as a sum of positive squares in only one way, i.e., 2603244484 + 547887649 = 51022^2 + 23407^2 .
It is not a de Polignac number, because 3151132133 - 22 = 3151132129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3151132099 and 3151132108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3151132139) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 46391 + ... + 91947.
It is an arithmetic number, because the mean of its divisors is an integer number (527204769).
Almost surely, 23151132133 is an apocalyptic number.
It is an amenable number.
3151132133 is a deficient number, since it is larger than the sum of its proper divisors (12096481).
3151132133 is an frugal number, since it uses more digits than its factorization.
3151132133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46083 (or 45820 counting only the distinct ones).
The product of its digits is 810, while the sum is 23.
The square root of 3151132133 is about 56134.9457379269. The cubic root of 3151132133 is about 1466.0728058964.
Adding to 3151132133 its reverse (3312311513), we get a palindrome (6463443646).
The spelling of 3151132133 in words is "three billion, one hundred fifty-one million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •