Base | Representation |
---|---|
bin | 11111110111100000001010… |
… | …100100011101011110011110 |
3 | 200101020112210212220111121201 |
4 | 133313200022210131132132 |
5 | 121332233432313230100 |
6 | 1214025352503150114 |
7 | 41343521424630541 |
oct | 3767401244353636 |
9 | 611215725814551 |
10 | 140153550133150 |
11 | 40725872288a34 |
12 | 1387684444533a |
13 | 6028566630358 |
14 | 268767a36a858 |
15 | 1130aaeacc36a |
hex | 7f780a91d79e |
140153550133150 has 12 divisors (see below), whose sum is σ = 260685603247752. Its totient is φ = 56061420053240.
The previous prime is 140153550133147. The next prime is 140153550133183. The reversal of 140153550133150 is 51331055351041.
It is a super-2 number, since 2×1401535501331502 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1401535501282 + ... + 1401535501381.
It is an arithmetic number, because the mean of its divisors is an integer number (21723800270646).
Almost surely, 2140153550133150 is an apocalyptic number.
140153550133150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140153550133150 is a deficient number, since it is larger than the sum of its proper divisors (120532053114602).
140153550133150 is a wasteful number, since it uses less digits than its factorization.
140153550133150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2803071002675 (or 2803071002670 counting only the distinct ones).
The product of its (nonzero) digits is 67500, while the sum is 37.
The spelling of 140153550133150 in words is "one hundred forty trillion, one hundred fifty-three billion, five hundred fifty million, one hundred thirty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •