Base | Representation |
---|---|
bin | 1001001010110010100… |
… | …00101001110010110011 |
3 | 1010010010222210202220022 |
4 | 10211121100221302303 |
5 | 20130140204302243 |
6 | 400420045234055 |
7 | 31521512044520 |
oct | 4453120516263 |
9 | 1103128722808 |
10 | 315030150323 |
11 | 111670341739 |
12 | 5107ab6292b |
13 | 239269a3195 |
14 | 11367374147 |
15 | 82dbe7bb68 |
hex | 4959429cb3 |
315030150323 has 16 divisors (see below), whose sum is σ = 370398764736. Its totient is φ = 262309148160.
The previous prime is 315030150317. The next prime is 315030150329. The reversal of 315030150323 is 323051030513.
It is an interprime number because it is at equal distance from previous prime (315030150317) and next prime (315030150329).
It is a cyclic number.
It is not a de Polignac number, because 315030150323 - 228 = 314761714867 is a prime.
It is a super-2 number, since 2×3150301503232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 315030150292 and 315030150301.
It is not an unprimeable number, because it can be changed into a prime (315030150329) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2288636 + ... + 2422377.
It is an arithmetic number, because the mean of its divisors is an integer number (23149922796).
Almost surely, 2315030150323 is an apocalyptic number.
315030150323 is a deficient number, since it is larger than the sum of its proper divisors (55368614413).
315030150323 is a wasteful number, since it uses less digits than its factorization.
315030150323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4711294.
The product of its (nonzero) digits is 4050, while the sum is 26.
Adding to 315030150323 its reverse (323051030513), we get a palindrome (638081180836).
The spelling of 315030150323 in words is "three hundred fifteen billion, thirty million, one hundred fifty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •