Base | Representation |
---|---|
bin | 100011110000010010101101… |
… | …1111001110011101001010001 |
3 | 1112020112221211010120012120100 |
4 | 1013200211123321303221101 |
5 | 312210234032131130001 |
6 | 3032515313441403013 |
7 | 123146625060064104 |
oct | 10740453371635121 |
9 | 1466487733505510 |
10 | 314500522130001 |
11 | 91233a168045a9 |
12 | 2b334384639469 |
13 | 1066436c70969c |
14 | 5793c995a073b |
15 | 2655d3112a586 |
hex | 11e095be73a51 |
314500522130001 has 24 divisors (see below), whose sum is σ = 456911696457216. Its totient is φ = 208451746671840.
The previous prime is 314500522129999. The next prime is 314500522130017. The reversal of 314500522130001 is 100031225005413.
314500522130001 is a `hidden beast` number, since 3 + 1 + 4 + 5 + 0 + 0 + 522 + 130 + 0 + 0 + 1 = 666.
It is not a de Polignac number, because 314500522130001 - 21 = 314500522129999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (314500522130801) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 98169586 + ... + 101322596.
It is an arithmetic number, because the mean of its divisors is an integer number (19037987352384).
Almost surely, 2314500522130001 is an apocalyptic number.
It is an amenable number.
314500522130001 is a deficient number, since it is larger than the sum of its proper divisors (142411174327215).
314500522130001 is a wasteful number, since it uses less digits than its factorization.
314500522130001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3217253 (or 3217250 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 314500522130001 its reverse (100031225005413), we get a palindrome (414531747135414).
The spelling of 314500522130001 in words is "three hundred fourteen trillion, five hundred billion, five hundred twenty-two million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •