Base | Representation |
---|---|
bin | 1000001101100010100… |
… | …0001100110000011011 |
3 | 111111010122102201202210 |
4 | 2003120220030300123 |
5 | 4302404240321024 |
6 | 144450323530203 |
7 | 13122633601212 |
oct | 2033050146033 |
9 | 444118381683 |
10 | 141073370139 |
11 | 5491326aaa9 |
12 | 23411229963 |
13 | 103c307a960 |
14 | 6b83dd8079 |
15 | 3a0a097129 |
hex | 20d8a0cc1b |
141073370139 has 32 divisors (see below), whose sum is σ = 205941443904. Its totient is φ = 85368890880.
The previous prime is 141073370131. The next prime is 141073370171. The reversal of 141073370139 is 931073370141.
It is not a de Polignac number, because 141073370139 - 23 = 141073370131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 141073370097 and 141073370106.
It is not an unprimeable number, because it can be changed into a prime (141073370131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16451257 + ... + 16459829.
It is an arithmetic number, because the mean of its divisors is an integer number (6435670122).
Almost surely, 2141073370139 is an apocalyptic number.
141073370139 is a deficient number, since it is larger than the sum of its proper divisors (64868073765).
141073370139 is a wasteful number, since it uses less digits than its factorization.
141073370139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15567.
The product of its (nonzero) digits is 47628, while the sum is 39.
The spelling of 141073370139 in words is "one hundred forty-one billion, seventy-three million, three hundred seventy thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •