Base | Representation |
---|---|
bin | 11111111000001100110111… |
… | …101101011111010101101011 |
3 | 200101102010201020002211200020 |
4 | 133320030313231133111223 |
5 | 121334030234320140201 |
6 | 1214103412012211523 |
7 | 41350141106014620 |
oct | 3770146755372553 |
9 | 611363636084606 |
10 | 140201552115051 |
11 | 40744165138459 |
12 | 13884000169ba3 |
13 | 602cc4646ab3b |
14 | 2689b1159a347 |
15 | 1131e6dd51a36 |
hex | 7f8337b5f56b |
140201552115051 has 16 divisors (see below), whose sum is σ = 213663385920000. Its totient is φ = 80106575554368.
The previous prime is 140201552115049. The next prime is 140201552115151. The reversal of 140201552115051 is 150511255102041.
It is a happy number.
It is not a de Polignac number, because 140201552115051 - 21 = 140201552115049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140201552115151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 358011426 + ... + 358402823.
It is an arithmetic number, because the mean of its divisors is an integer number (13353961620000).
Almost surely, 2140201552115051 is an apocalyptic number.
140201552115051 is a deficient number, since it is larger than the sum of its proper divisors (73461833804949).
140201552115051 is an equidigital number, since it uses as much as digits as its factorization.
140201552115051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 716423578.
The product of its (nonzero) digits is 10000, while the sum is 33.
The spelling of 140201552115051 in words is "one hundred forty trillion, two hundred one billion, five hundred fifty-two million, one hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •