Base | Representation |
---|---|
bin | 11011010010100111001010… |
… | …000111111010000110110111 |
3 | 120201222101201212211210202011 |
4 | 123102213022013322012313 |
5 | 111213002231023013432 |
6 | 1103135144331425051 |
7 | 34165416263635123 |
oct | 3322471207720667 |
9 | 521871655753664 |
10 | 120026252157367 |
11 | 352759362a0636 |
12 | 11565a84bb5187 |
13 | 51c85721b99ba |
14 | 218d431842583 |
15 | dd2259217847 |
hex | 6d29ca1fa1b7 |
120026252157367 has 4 divisors (see below), whose sum is σ = 120286612791576. Its totient is φ = 119765891523160.
The previous prime is 120026252157311. The next prime is 120026252157373. The reversal of 120026252157367 is 763751252620021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120026252157367 - 211 = 120026252155319 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 120026252157367.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120026252107367) 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, 130180316413 + ... + 130180317334.
It is an arithmetic number, because the mean of its divisors is an integer number (30071653197894).
Almost surely, 2120026252157367 is an apocalyptic number.
120026252157367 is a deficient number, since it is larger than the sum of its proper divisors (260360634209).
120026252157367 is an equidigital number, since it uses as much as digits as its factorization.
120026252157367 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260360634208.
The product of its (nonzero) digits is 2116800, while the sum is 49.
The spelling of 120026252157367 in words is "one hundred twenty trillion, twenty-six billion, two hundred fifty-two million, one hundred fifty-seven thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •