Base | Representation |
---|---|
bin | 1000000110101111111… |
… | …0010111000110101110 |
3 | 111022102121022110111010 |
4 | 2001223332113012232 |
5 | 4240141104310100 |
6 | 143545404410050 |
7 | 13026520256451 |
oct | 2015376270656 |
9 | 438377273433 |
10 | 139250463150 |
11 | 5406828aaa7 |
12 | 22ba2846926 |
13 | 101924ca276 |
14 | 6a4dc7b498 |
15 | 3950016750 |
hex | 206bf971ae |
139250463150 has 48 divisors (see below), whose sum is σ = 345378505968. Its totient is φ = 37129440000.
The previous prime is 139250463133. The next prime is 139250463151. The reversal of 139250463150 is 51364052931.
It is a junction number, because it is equal to n+sod(n) for n = 139250463099 and 139250463108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139250463151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1500090 + ... + 1590210.
It is an arithmetic number, because the mean of its divisors is an integer number (7195385541).
Almost surely, 2139250463150 is an apocalyptic number.
139250463150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
139250463150 is an abundant number, since it is smaller than the sum of its proper divisors (206128042818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139250463150 is a wasteful number, since it uses less digits than its factorization.
139250463150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100437 (or 100432 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 39.
The spelling of 139250463150 in words is "one hundred thirty-nine billion, two hundred fifty million, four hundred sixty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •