Base | Representation |
---|---|
bin | 1000011100101000100… |
… | …0010100100110000010 |
3 | 111212121000110221010020 |
4 | 2013022020110212002 |
5 | 4334204011144111 |
6 | 150400342314310 |
7 | 13325222665353 |
oct | 2071210244602 |
9 | 455530427106 |
10 | 145125099906 |
11 | 566023765a6 |
12 | 24162128996 |
13 | 108ba611ba7 |
14 | 704a175d2a |
15 | 3b95b39906 |
hex | 21ca214982 |
145125099906 has 8 divisors (see below), whose sum is σ = 290250199824. Its totient is φ = 48375033300.
The previous prime is 145125099871. The next prime is 145125099923. The reversal of 145125099906 is 609990521541.
It is a sphenic number, since it is the product of 3 distinct primes.
145125099906 is an admirable number.
It is a super-2 number, since 2×1451250999062 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12093758320 + ... + 12093758331.
It is an arithmetic number, because the mean of its divisors is an integer number (36281274978).
Almost surely, 2145125099906 is an apocalyptic number.
145125099906 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145125099906 is a wasteful number, since it uses less digits than its factorization.
145125099906 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24187516656.
The product of its (nonzero) digits is 874800, while the sum is 51.
The spelling of 145125099906 in words is "one hundred forty-five billion, one hundred twenty-five million, ninety-nine thousand, nine hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •