Base | Representation |
---|---|
bin | 11111111001111101001111… |
… | …100111101100010111100110 |
3 | 200101211200011020120222222102 |
4 | 133321331033213230113212 |
5 | 121343014342324124110 |
6 | 1214235045011332102 |
7 | 41361642142652030 |
oct | 3771751747542746 |
9 | 611750136528872 |
10 | 140322212333030 |
11 | 40790352740072 |
12 | 138a3474bb1032 |
13 | 603b435376020 |
14 | 26918ba482c50 |
15 | 1135181c6c5a5 |
hex | 7f9f4f9ec5e6 |
140322212333030 has 64 divisors (see below), whose sum is σ = 324383656117248. Its totient is φ = 42478812097920.
The previous prime is 140322212333021. The next prime is 140322212333057. The reversal of 140322212333030 is 30333212223041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 140322212332984 and 140322212333002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3352158056 + ... + 3352199915.
It is an arithmetic number, because the mean of its divisors is an integer number (5068494626832).
Almost surely, 2140322212333030 is an apocalyptic number.
140322212333030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140322212333030 is an abundant number, since it is smaller than the sum of its proper divisors (184061443784218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140322212333030 is a wasteful number, since it uses less digits than its factorization.
140322212333030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6704358021.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 140322212333030 its reverse (30333212223041), we get a palindrome (170655424556071).
The spelling of 140322212333030 in words is "one hundred forty trillion, three hundred twenty-two billion, two hundred twelve million, three hundred thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •