Base | Representation |
---|---|
bin | 1000110000010100101011… |
… | …11100100001001111011100 |
3 | 2112011112012221112012201020 |
4 | 10120022111330201033130 |
5 | 10010413220111400102 |
6 | 104540300433244140 |
7 | 4024644235100166 |
oct | 430122574411734 |
9 | 75145187465636 |
10 | 19252559090652 |
11 | 6152a6776a048 |
12 | 21ab337103650 |
13 | a9867c325604 |
14 | 4a7b86459936 |
15 | 235c0ae37bbc |
hex | 118295f213dc |
19252559090652 has 24 divisors (see below), whose sum is σ = 44935506104832. Its totient is φ = 6415681378800.
The previous prime is 19252559090621. The next prime is 19252559090659. The reversal of 19252559090652 is 25609095525291.
It is a happy number.
It is a super-2 number, since 2×192525590906522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19252559090659) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229746124 + ... + 229829907.
It is an arithmetic number, because the mean of its divisors is an integer number (1872312754368).
Almost surely, 219252559090652 is an apocalyptic number.
19252559090652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
19252559090652 is an abundant number, since it is smaller than the sum of its proper divisors (25682947014180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19252559090652 is a wasteful number, since it uses less digits than its factorization.
19252559090652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459579529 (or 459579527 counting only the distinct ones).
The product of its (nonzero) digits is 21870000, while the sum is 60.
The spelling of 19252559090652 in words is "nineteen trillion, two hundred fifty-two billion, five hundred fifty-nine million, ninety thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •