Base | Representation |
---|---|
bin | 100001000001000110110111… |
… | …110111111111110001100000 |
3 | 201001011002121110110222012120 |
4 | 201001012313313333301200 |
5 | 123013121411330021003 |
6 | 1232501145343224240 |
7 | 42405123444163320 |
oct | 4101066767776140 |
9 | 631132543428176 |
10 | 145211634220128 |
11 | 422a59a9948763 |
12 | 14352ba25a8080 |
13 | 6304524238b48 |
14 | 27c03cdd59280 |
15 | 11bc44b74d853 |
hex | 8411b7dffc60 |
145211634220128 has 48 divisors (see below), whose sum is σ = 435634902662400. Its totient is φ = 41489038348416.
The previous prime is 145211634220117. The next prime is 145211634220189. The reversal of 145211634220128 is 821022436112541.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 145211634220128.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108044370028 + ... + 108044371371.
It is an arithmetic number, because the mean of its divisors is an integer number (9075727138800).
Almost surely, 2145211634220128 is an apocalyptic number.
It is an amenable number.
145211634220128 is an abundant number, since it is smaller than the sum of its proper divisors (290423268442272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145211634220128 is a wasteful number, since it uses less digits than its factorization.
145211634220128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216088741419 (or 216088741411 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 42.
The spelling of 145211634220128 in words is "one hundred forty-five trillion, two hundred eleven billion, six hundred thirty-four million, two hundred twenty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •