Base | Representation |
---|---|
bin | 1001001010011001101111… |
… | …00011100110111111100100 |
3 | 2122100012010020010001211101 |
4 | 10211030313203212333210 |
5 | 10120103340124322142 |
6 | 110504052215045444 |
7 | 4146455451241660 |
oct | 445146743467744 |
9 | 78305106101741 |
10 | 20148623667172 |
11 | 6468a8a871a40 |
12 | 2314b31370884 |
13 | b32012680070 |
14 | 4d92accdb8a0 |
15 | 24e1a2be80b7 |
hex | 1253378e6fe4 |
20148623667172 has 384 divisors, whose sum is σ = 50153634349056. Its totient is φ = 6825772800000.
The previous prime is 20148623667169. The next prime is 20148623667299. The reversal of 20148623667172 is 27176632684102.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10598959422 + ... + 10598961322.
It is an arithmetic number, because the mean of its divisors is an integer number (130608422784).
Almost surely, 220148623667172 is an apocalyptic number.
20148623667172 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20148623667172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25076817174528).
20148623667172 is an abundant number, since it is smaller than the sum of its proper divisors (30005010681884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20148623667172 is a wasteful number, since it uses less digits than its factorization.
20148623667172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3651 (or 3649 counting only the distinct ones).
The product of its (nonzero) digits is 8128512, while the sum is 55.
The spelling of 20148623667172 in words is "twenty trillion, one hundred forty-eight billion, six hundred twenty-three million, six hundred sixty-seven thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •