Base | Representation |
---|---|
bin | 100011101101100100000001… |
… | …0000001010111001010110000 |
3 | 1112012020002102212210020120101 |
4 | 1013123020002001113022300 |
5 | 312133112210103200240 |
6 | 3032031110003522144 |
7 | 123110544025462051 |
oct | 10733100201271260 |
9 | 1465202385706511 |
10 | 314125352006320 |
11 | 910a98a4a81848 |
12 | 2b293720989354 |
13 | 10637b802ab16a |
14 | 577da68d3c728 |
15 | 264b1c44ec39a |
hex | 11db2020572b0 |
314125352006320 has 80 divisors (see below), whose sum is σ = 733264802861472. Its totient is φ = 125147215872000.
The previous prime is 314125352006311. The next prime is 314125352006327. The reversal of 314125352006320 is 23600253521413.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 314125352006320.
It is not an unprimeable number, because it can be changed into a prime (314125352006327) 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, 1430248834 + ... + 1430468446.
Almost surely, 2314125352006320 is an apocalyptic number.
It is an amenable number.
314125352006320 is an abundant number, since it is smaller than the sum of its proper divisors (419139450855152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
314125352006320 is a wasteful number, since it uses less digits than its factorization.
314125352006320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291110 (or 291104 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 37.
The spelling of 314125352006320 in words is "three hundred fourteen trillion, one hundred twenty-five billion, three hundred fifty-two million, six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •