Base | Representation |
---|---|
bin | 1000101000000111001110… |
… | …11110111111000011111100 |
3 | 2111011120001220212220210120 |
4 | 10110003213132333003330 |
5 | 4441303000031114102 |
6 | 104202524134334540 |
7 | 3665366443652115 |
oct | 424034736770374 |
9 | 74146056786716 |
10 | 18970459238652 |
11 | 6054365754999 |
12 | 21647284ba450 |
13 | a77ba2b35c6c |
14 | 49826479120c |
15 | 22d6e9eab6bc |
hex | 1140e77bf0fc |
18970459238652 has 48 divisors (see below), whose sum is σ = 45491725289472. Its totient is φ = 6149159694720.
The previous prime is 18970459238581. The next prime is 18970459238657. The reversal of 18970459238652 is 25683295407981.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18970459238657) 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, 62646748 + ... + 62948835.
It is an arithmetic number, because the mean of its divisors is an integer number (947744276864).
It is a 1-persistent number, because it is pandigital, but 2⋅18970459238652 = 37940918477304 is not.
Almost surely, 218970459238652 is an apocalyptic number.
18970459238652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
18970459238652 is an abundant number, since it is smaller than the sum of its proper divisors (26521266050820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18970459238652 is a wasteful number, since it uses less digits than its factorization.
18970459238652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125595938 (or 125595936 counting only the distinct ones).
The product of its (nonzero) digits is 261273600, while the sum is 69.
The spelling of 18970459238652 in words is "eighteen trillion, nine hundred seventy billion, four hundred fifty-nine million, two hundred thirty-eight thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •