Base | Representation |
---|---|
bin | 1001001100101011001… |
… | …00111100000110100001 |
3 | 1010012202111222012110200 |
4 | 10212111210330012201 |
5 | 20134223234214103 |
6 | 401104315015413 |
7 | 31555550351502 |
oct | 4462544740641 |
9 | 1105674865420 |
10 | 316042101153 |
11 | 11203a588339 |
12 | 51301a3a569 |
13 | 23a58535b5c |
14 | 11421912ba9 |
15 | 834ac1e0a3 |
hex | 499593c1a1 |
316042101153 has 24 divisors (see below), whose sum is σ = 457667124096. Its totient is φ = 210159036000.
The previous prime is 316042101073. The next prime is 316042101211. The reversal of 316042101153 is 351101240613.
It is a happy number.
316042101153 is a `hidden beast` number, since 3 + 1 + 604 + 2 + 1 + 0 + 1 + 1 + 53 = 666.
It is not a de Polignac number, because 316042101153 - 28 = 316042100897 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (316042108153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7218378 + ... + 7262028.
It is an arithmetic number, because the mean of its divisors is an integer number (19069463504).
Almost surely, 2316042101153 is an apocalyptic number.
It is an amenable number.
316042101153 is a deficient number, since it is larger than the sum of its proper divisors (141625022943).
316042101153 is a wasteful number, since it uses less digits than its factorization.
316042101153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45685 (or 45682 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 316042101153 its reverse (351101240613), we get a palindrome (667143341766).
The spelling of 316042101153 in words is "three hundred sixteen billion, forty-two million, one hundred one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •