Base | Representation |
---|---|
bin | 1001001011010110100… |
… | …01010100011111111101 |
3 | 1010010221001101100002120 |
4 | 10211223101110133331 |
5 | 20131300033041013 |
6 | 400510041513153 |
7 | 31532141311503 |
oct | 4455321243775 |
9 | 1103831340076 |
10 | 315332315133 |
11 | 111805964620 |
12 | 511441a27b9 |
13 | 2397447b424 |
14 | 1139554c673 |
15 | 8308767123 |
hex | 496b4547fd |
315332315133 has 32 divisors (see below), whose sum is σ = 459844439040. Its totient is φ = 190619600640.
The previous prime is 315332315131. The next prime is 315332315159. The reversal of 315332315133 is 331513233513.
It is not a de Polignac number, because 315332315133 - 21 = 315332315131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 315332315094 and 315332315103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315332315131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35334810 + ... + 35343732.
It is an arithmetic number, because the mean of its divisors is an integer number (14370138720).
Almost surely, 2315332315133 is an apocalyptic number.
315332315133 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
315332315133 is a deficient number, since it is larger than the sum of its proper divisors (144512123907).
315332315133 is a wasteful number, since it uses less digits than its factorization.
315332315133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11569.
The product of its digits is 36450, while the sum is 33.
Adding to 315332315133 its reverse (331513233513), we get a palindrome (646845548646).
The spelling of 315332315133 in words is "three hundred fifteen billion, three hundred thirty-two million, three hundred fifteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •