Base | Representation |
---|---|
bin | 11011010010100110101010… |
… | …110010010011101001111111 |
3 | 120201222100101020112121210201 |
4 | 123102212222302103221333 |
5 | 111213000141424314101 |
6 | 1103135020230544331 |
7 | 34165400251036144 |
oct | 3322465262235177 |
9 | 521870336477721 |
10 | 120025726401151 |
11 | 3527569654216a |
12 | 11565958b080a7 |
13 | 51c84ba2b744c |
14 | 218d3c1aa43cb |
15 | dd2227eb2e01 |
hex | 6d29aac93a7f |
120025726401151 has 4 divisors (see below), whose sum is σ = 120371621866632. Its totient is φ = 119679830935672.
The previous prime is 120025726401083. The next prime is 120025726401173. The reversal of 120025726401151 is 151104627520021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120025726401151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120025726401151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120025726402151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172947732220 + ... + 172947732913.
It is an arithmetic number, because the mean of its divisors is an integer number (30092905466658).
Almost surely, 2120025726401151 is an apocalyptic number.
120025726401151 is a deficient number, since it is larger than the sum of its proper divisors (345895465481).
120025726401151 is an equidigital number, since it uses as much as digits as its factorization.
120025726401151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345895465480.
The product of its (nonzero) digits is 33600, while the sum is 37.
The spelling of 120025726401151 in words is "one hundred twenty trillion, twenty-five billion, seven hundred twenty-six million, four hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •