Base | Representation |
---|---|
bin | 11011010010100111001001… |
… | …100001110000011011101111 |
3 | 120201222101201012000200211012 |
4 | 123102213021201300123233 |
5 | 111213002220443000041 |
6 | 1103135143333215435 |
7 | 34165416112632323 |
oct | 3322471141603357 |
9 | 521871635020735 |
10 | 120026242156271 |
11 | 3527593068a670 |
12 | 11565a8179157b |
13 | 51c85700c77a9 |
14 | 218d43039b983 |
15 | dd22583de3eb |
hex | 6d29c98706ef |
120026242156271 has 16 divisors (see below), whose sum is σ = 138760389439488. Its totient is φ = 102607026288000.
The previous prime is 120026242156259. The next prime is 120026242156309. The reversal of 120026242156271 is 172651242620021.
It is a cyclic number.
It is not a de Polignac number, because 120026242156271 - 242 = 115628195645167 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 (120026242156201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 278608205 + ... + 279038678.
It is an arithmetic number, because the mean of its divisors is an integer number (8672524339968).
Almost surely, 2120026242156271 is an apocalyptic number.
120026242156271 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120026242156271 is a deficient number, since it is larger than the sum of its proper divisors (18734147283217).
120026242156271 is a wasteful number, since it uses less digits than its factorization.
120026242156271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557648062.
The product of its (nonzero) digits is 161280, while the sum is 41.
Adding to 120026242156271 its reverse (172651242620021), we get a palindrome (292677484776292).
The spelling of 120026242156271 in words is "one hundred twenty trillion, twenty-six billion, two hundred forty-two million, one hundred fifty-six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •