Base | Representation |
---|---|
bin | 1000101000000111001110… |
… | …11110111110001101111100 |
3 | 2111011120001220212202001120 |
4 | 10110003213132332031330 |
5 | 4441303000031011241 |
6 | 104202524134310540 |
7 | 3665366443636050 |
oct | 424034736761574 |
9 | 74146056782046 |
10 | 18970459235196 |
11 | 6054365752337 |
12 | 21647284b8450 |
13 | a77ba2b34511 |
14 | 49826478dc60 |
15 | 22d6e9eaa666 |
hex | 1140e77be37c |
18970459235196 has 48 divisors (see below), whose sum is σ = 50898246491904. Its totient is φ = 5386878867456.
The previous prime is 18970459235177. The next prime is 18970459235197. The reversal of 18970459235196 is 69153295407981.
It is a self number, because there is not a number n which added to its sum of digits gives 18970459235196.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18970459235197) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 692743365 + ... + 692770748.
It is an arithmetic number, because the mean of its divisors is an integer number (1060380135248).
It is a 1-persistent number, because it is pandigital, but 2⋅18970459235196 = 37940918470392 is not.
Almost surely, 218970459235196 is an apocalyptic number.
It is an amenable number.
18970459235196 is an abundant number, since it is smaller than the sum of its proper divisors (31927787256708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18970459235196 is a wasteful number, since it uses less digits than its factorization.
18970459235196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1385514290 (or 1385514288 counting only the distinct ones).
The product of its (nonzero) digits is 146966400, while the sum is 69.
The spelling of 18970459235196 in words is "eighteen trillion, nine hundred seventy billion, four hundred fifty-nine million, two hundred thirty-five thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •