Base | Representation |
---|---|
bin | 1001001011001000100… |
… | …01111000011110110101 |
3 | 1010010121212200020011122 |
4 | 10211210101320132311 |
5 | 20131030021201010 |
6 | 400450251513325 |
7 | 31526215323152 |
oct | 4454421703665 |
9 | 1103555606148 |
10 | 315215022005 |
11 | 111755731554 |
12 | 51110a58845 |
13 | 23956091600 |
14 | 11383b39229 |
15 | 82ed2e8855 |
hex | 49644787b5 |
315215022005 has 12 divisors (see below), whose sum is σ = 409593011940. Its totient is φ = 232774169472.
The previous prime is 315215021983. The next prime is 315215022019. The reversal of 315215022005 is 500220512513.
It can be written as a sum of positive squares in 6 ways, for example, as 162835653841 + 152379368164 = 403529^2 + 390358^2 .
It is not a de Polignac number, because 315215022005 - 28 = 315215021749 is a prime.
It is a super-2 number, since 2×3152150220052 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 186516920 + ... + 186518609.
It is an arithmetic number, because the mean of its divisors is an integer number (34132750995).
Almost surely, 2315215022005 is an apocalyptic number.
It is an amenable number.
315215022005 is a deficient number, since it is larger than the sum of its proper divisors (94377989935).
315215022005 is a wasteful number, since it uses less digits than its factorization.
315215022005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373035560 (or 373035547 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 315215022005 its reverse (500220512513), we get a palindrome (815435534518).
The spelling of 315215022005 in words is "three hundred fifteen billion, two hundred fifteen million, twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •