Base | Representation |
---|---|
bin | 100011110100000100101000… |
… | …0000111110000001011100011 |
3 | 1112022101121201111222211011110 |
4 | 1013220021100013300023203 |
5 | 312242241442432031201 |
6 | 3033554110335314403 |
7 | 123232305436640106 |
oct | 10750112007601343 |
9 | 1468347644884143 |
10 | 315020015502051 |
11 | 91414269217a32 |
12 | 2b3b8ba597ba03 |
13 | 106a134c299222 |
14 | 57b109b6aa73d |
15 | 26645d82a26d6 |
hex | 11e82501f02e3 |
315020015502051 has 8 divisors (see below), whose sum is σ = 420139932615760. Its totient is φ = 209956721028192.
The previous prime is 315020015502029. The next prime is 315020015502053. The reversal of 315020015502051 is 150205510020513.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 315020015502051 - 218 = 315020015239907 is a prime.
It is a super-2 number, since 2×3150200155020512 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (315020015502053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14155646980 + ... + 14155669233.
It is an arithmetic number, because the mean of its divisors is an integer number (52517491576970).
Almost surely, 2315020015502051 is an apocalyptic number.
315020015502051 is a deficient number, since it is larger than the sum of its proper divisors (105119917113709).
315020015502051 is a wasteful number, since it uses less digits than its factorization.
315020015502051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28311319925.
The product of its (nonzero) digits is 7500, while the sum is 30.
Adding to 315020015502051 its reverse (150205510020513), we get a palindrome (465225525522564).
The spelling of 315020015502051 in words is "three hundred fifteen trillion, twenty billion, fifteen million, five hundred two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •