Base | Representation |
---|---|
bin | 100011110100010100100100… |
… | …1100000010011100001000101 |
3 | 1112022111220010101000202221221 |
4 | 1013220221021200103201011 |
5 | 312243322113121023401 |
6 | 3034021533024440341 |
7 | 123234630240242515 |
oct | 10750511140234105 |
9 | 1468456111022857 |
10 | 315054264236101 |
11 | 91427843793815 |
12 | 2b4037637790b1 |
13 | 106a4649971130 |
14 | 57b29ca0d5845 |
15 | 266543edd57a1 |
hex | 11e8a49813845 |
315054264236101 has 8 divisors (see below), whose sum is σ = 339673453639520. Its totient is φ = 290489967118512.
The previous prime is 315054264236071. The next prime is 315054264236189. The reversal of 315054264236101 is 101632462450513.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 315054264236101 - 27 = 315054264235973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (315054264239101) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 13723059531 + ... + 13723082488.
It is an arithmetic number, because the mean of its divisors is an integer number (42459181704940).
Almost surely, 2315054264236101 is an apocalyptic number.
It is an amenable number.
315054264236101 is a deficient number, since it is larger than the sum of its proper divisors (24619189403419).
315054264236101 is a wasteful number, since it uses less digits than its factorization.
315054264236101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27446142915.
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 315054264236101 in words is "three hundred fifteen trillion, fifty-four billion, two hundred sixty-four million, two hundred thirty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •