Base | Representation |
---|---|
bin | 11011010010011000010101… |
… | …110001001100001101000101 |
3 | 120201220212200000221122202121 |
4 | 123102120111301030031011 |
5 | 111212222134344321123 |
6 | 1103123553441005541 |
7 | 34164314064511411 |
oct | 3322302561141505 |
9 | 521825600848677 |
10 | 120010341401413 |
11 | 3526a111070151 |
12 | 115629846238b1 |
13 | 51c6c07a7c5c8 |
14 | 218c7626a1d41 |
15 | dd1b2749e75d |
hex | 6d2615c4c345 |
120010341401413 has 8 divisors (see below), whose sum is σ = 123006221356032. Its totient is φ = 117032897631696.
The previous prime is 120010341401389. The next prime is 120010341401429. The reversal of 120010341401413 is 314104143010021.
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 120010341401413 - 225 = 120010307846981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120010341401453) 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, 4609033045 + ... + 4609059082.
It is an arithmetic number, because the mean of its divisors is an integer number (15375777669504).
Almost surely, 2120010341401413 is an apocalyptic number.
It is an amenable number.
120010341401413 is a deficient number, since it is larger than the sum of its proper divisors (2995879954619).
120010341401413 is an equidigital number, since it uses as much as digits as its factorization.
120010341401413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9218092451.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 120010341401413 its reverse (314104143010021), we get a palindrome (434114484411434).
The spelling of 120010341401413 in words is "one hundred twenty trillion, ten billion, three hundred forty-one million, four hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •