Base | Representation |
---|---|
bin | 11011010110101111101001… |
… | …110110111010100011100001 |
3 | 120202222112210100102201101002 |
4 | 123112233221312322203201 |
5 | 111232130344104241301 |
6 | 1103513433354521345 |
7 | 34225062132203042 |
oct | 3326575166724341 |
9 | 522875710381332 |
10 | 120310252415201 |
11 | 35375323008822 |
12 | 115b0b24136255 |
13 | 5219292322844 |
14 | 219d093a7c8c9 |
15 | dd982be3216b |
hex | 6d6be9dba8e1 |
120310252415201 has 8 divisors (see below), whose sum is σ = 120813529137000. Its totient is φ = 119807881683840.
The previous prime is 120310252415131. The next prime is 120310252415219. The reversal of 120310252415201 is 102514252013021.
It can be written as a sum of positive squares in 4 ways, for example, as 1340535574225 + 118969716840976 = 1157815^2 + 10907324^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120310252415201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120310252415231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 226231466 + ... + 226762643.
It is an arithmetic number, because the mean of its divisors is an integer number (15101691142125).
Almost surely, 2120310252415201 is an apocalyptic number.
It is an amenable number.
120310252415201 is a deficient number, since it is larger than the sum of its proper divisors (503276721799).
120310252415201 is an equidigital number, since it uses as much as digits as its factorization.
120310252415201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452995219.
The product of its (nonzero) digits is 4800, while the sum is 29.
The spelling of 120310252415201 in words is "one hundred twenty trillion, three hundred ten billion, two hundred fifty-two million, four hundred fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •