Base | Representation |
---|---|
bin | 11111110111001101010100… |
… | …010110000010111101100000 |
3 | 200101011121120112020020210002 |
4 | 133313031110112002331200 |
5 | 121331421011114011112 |
6 | 1214012204423555132 |
7 | 41342204063253665 |
oct | 3767152426027540 |
9 | 611147515206702 |
10 | 140133313032032 |
11 | 40718227a36381 |
12 | 13872936bbbaa8 |
13 | 602668caab1c8 |
14 | 26866ba7a5a6c |
15 | 11302c81291c2 |
hex | 7f7354582f60 |
140133313032032 has 48 divisors (see below), whose sum is σ = 282113594053200. Its totient is φ = 68498538462720.
The previous prime is 140133313032001. The next prime is 140133313032043. The reversal of 140133313032032 is 230230313331041.
It is a junction number, because it is equal to n+sod(n) for n = 140133313031986 and 140133313032004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204694607 + ... + 205378062.
It is an arithmetic number, because the mean of its divisors is an integer number (5877366542775).
Almost surely, 2140133313032032 is an apocalyptic number.
It is an amenable number.
140133313032032 is an abundant number, since it is smaller than the sum of its proper divisors (141980281021168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140133313032032 is a wasteful number, since it uses less digits than its factorization.
140133313032032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410072919 (or 410072911 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 140133313032032 its reverse (230230313331041), we get a palindrome (370363626363073).
The spelling of 140133313032032 in words is "one hundred forty trillion, one hundred thirty-three billion, three hundred thirteen million, thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •