Base | Representation |
---|---|
bin | 11111111000010010011011… |
… | …110010000100011010000000 |
3 | 200101102201010120000212012112 |
4 | 133320102123302010122000 |
5 | 121334130003124114402 |
6 | 1214110240453314452 |
7 | 41350442125153532 |
oct | 3770223362043200 |
9 | 611381116025175 |
10 | 140207526004352 |
11 | 40746750254954 |
12 | 138851a8935a28 |
13 | 6030688cc3c91 |
14 | 268a11ab2d852 |
15 | 11321bd52ce52 |
hex | 7f849bc84680 |
140207526004352 has 128 divisors (see below), whose sum is σ = 286457431176000. Its totient is φ = 68334473281536.
The previous prime is 140207526004267. The next prime is 140207526004387. The reversal of 140207526004352 is 253400625702041.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×1402075260043522 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7935218174 + ... + 7935235842.
Almost surely, 2140207526004352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140207526004352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143228715588000).
140207526004352 is an abundant number, since it is smaller than the sum of its proper divisors (146249905171648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140207526004352 is an equidigital number, since it uses as much as digits as its factorization.
140207526004352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27386 (or 27374 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 41.
The spelling of 140207526004352 in words is "one hundred forty trillion, two hundred seven billion, five hundred twenty-six million, four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •