Base | Representation |
---|---|
bin | 100011110101000001101100… |
… | …0010110111110010000101100 |
3 | 1112022212011012112002022101212 |
4 | 1013222003120112332100230 |
5 | 312301414023423242030 |
6 | 3034134234551253552 |
7 | 123244630202404124 |
oct | 10752033026762054 |
9 | 1468764175068355 |
10 | 315151150212140 |
11 | 914649413595a0 |
12 | 2b41a4a267a2b8 |
13 | 106b081a285538 |
14 | 57b757b74bc84 |
15 | 2667c10a56595 |
hex | 11ea0d85be42c |
315151150212140 has 96 divisors (see below), whose sum is σ = 722585629846080. Its totient is φ = 114504722841600.
The previous prime is 315151150212121. The next prime is 315151150212161. The reversal of 315151150212140 is 41212051151513.
It is a junction number, because it is equal to n+sod(n) for n = 315151150212097 and 315151150212106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3117510716 + ... + 3117611804.
It is an arithmetic number, because the mean of its divisors is an integer number (7526933644230).
Almost surely, 2315151150212140 is an apocalyptic number.
It is an amenable number.
315151150212140 is an abundant number, since it is smaller than the sum of its proper divisors (407434479633940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
315151150212140 is a wasteful number, since it uses less digits than its factorization.
315151150212140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112803 (or 112801 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 32.
The spelling of 315151150212140 in words is "three hundred fifteen trillion, one hundred fifty-one billion, one hundred fifty million, two hundred twelve thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •