Base | Representation |
---|---|
bin | 100011110100010000010111… |
… | …1101000100000010010100001 |
3 | 1112022111000211110210110002121 |
4 | 1013220200233220200102201 |
5 | 312243200123000241421 |
6 | 3034013441345144241 |
7 | 123234160513463005 |
oct | 10750405750402241 |
9 | 1468430743713077 |
10 | 315045240243361 |
11 | 91423a329a5481 |
12 | 2b401a6562b081 |
13 | 106a383c240264 |
14 | 57b23b1836705 |
15 | 26650b2a69d41 |
hex | 11e882fa204a1 |
315045240243361 has 16 divisors (see below), whose sum is σ = 325993631990400. Its totient is φ = 304102508588928.
The previous prime is 315045240243353. The next prime is 315045240243373. The reversal of 315045240243361 is 163342042540513.
It is a cyclic number.
It is not a de Polignac number, because 315045240243361 - 23 = 315045240243353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (315045240243061) 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 15 ways as a sum of consecutive naturals, for example, 2154774886 + ... + 2154921088.
It is an arithmetic number, because the mean of its divisors is an integer number (20374601999400).
Almost surely, 2315045240243361 is an apocalyptic number.
It is an amenable number.
315045240243361 is a deficient number, since it is larger than the sum of its proper divisors (10948391747039).
315045240243361 is a wasteful number, since it uses less digits than its factorization.
315045240243361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165048.
The product of its (nonzero) digits is 1036800, while the sum is 43.
Adding to 315045240243361 its reverse (163342042540513), we get a palindrome (478387282783874).
The spelling of 315045240243361 in words is "three hundred fifteen trillion, forty-five billion, two hundred forty million, two hundred forty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •