Base | Representation |
---|---|
bin | 11111111000010111101000… |
… | …000101110000101100111000 |
3 | 200101110020112002202020220220 |
4 | 133320113220011300230320 |
5 | 121334222412401432412 |
6 | 1214113002013220040 |
7 | 41351030233441002 |
oct | 3770275005605470 |
9 | 611406462666826 |
10 | 140213101202232 |
11 | 4074905130a603 |
12 | 138862a3a91620 |
13 | 6031067076336 |
14 | 268a4c935d372 |
15 | 11323e7c0368c |
hex | 7f85e8170b38 |
140213101202232 has 32 divisors (see below), whose sum is σ = 360006611197200. Its totient is φ = 45474519308544.
The previous prime is 140213101202231. The next prime is 140213101202261. The reversal of 140213101202232 is 232202101312041.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140213101202231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78948817357 + ... + 78948819132.
Almost surely, 2140213101202232 is an apocalyptic number.
140213101202232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
140213101202232 is an abundant number, since it is smaller than the sum of its proper divisors (219793509994968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140213101202232 is a wasteful number, since it uses less digits than its factorization.
140213101202232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157897636535 (or 157897636531 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 140213101202232 its reverse (232202101312041), we get a palindrome (372415202514273).
The spelling of 140213101202232 in words is "one hundred forty trillion, two hundred thirteen billion, one hundred one million, two hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •