Base | Representation |
---|---|
bin | 1000001001101110100… |
… | …0110010001011100100 |
3 | 111101111022222220012120 |
4 | 2002123220302023210 |
5 | 4243310312111002 |
6 | 144201011545540 |
7 | 13055400215040 |
oct | 2023350621344 |
9 | 441438886176 |
10 | 140050113252 |
11 | 54438701a55 |
12 | 231865bb2b0 |
13 | 1028c089aca |
14 | 6ac8155020 |
15 | 399a31ecbc |
hex | 209ba322e4 |
140050113252 has 144 divisors (see below), whose sum is σ = 407452875648. Its totient is φ = 36642447360.
The previous prime is 140050113101. The next prime is 140050113283. The reversal of 140050113252 is 252311050041.
It is a happy number.
It is a super-2 number, since 2×1400501132522 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 820252 + ... + 976172.
Almost surely, 2140050113252 is an apocalyptic number.
140050113252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140050113252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203726437824).
140050113252 is an abundant number, since it is smaller than the sum of its proper divisors (267402762396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140050113252 is a wasteful number, since it uses less digits than its factorization.
140050113252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156006 (or 155987 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 140050113252 its reverse (252311050041), we get a palindrome (392361163293).
The spelling of 140050113252 in words is "one hundred forty billion, fifty million, one hundred thirteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •