Base | Representation |
---|---|
bin | 1001001110100001111000… |
… | …1111100100011011011101 |
3 | 1022220212120211120021112200 |
4 | 2103220132033210123131 |
5 | 2312204402324313010 |
6 | 33324352204522113 |
7 | 2064653004303612 |
oct | 223503617443335 |
9 | 38825524507480 |
10 | 10145220151005 |
11 | 3261622320945 |
12 | 117a265850339 |
13 | 5878c836a464 |
14 | 271061b68509 |
15 | 128d790a5cc0 |
hex | 93a1e3e46dd |
10145220151005 has 24 divisors (see below), whose sum is σ = 17594467287072. Its totient is φ = 5407885918944.
The previous prime is 10145220150959. The next prime is 10145220151019. The reversal of 10145220151005 is 50015102254101.
It is a happy number.
10145220151005 is a `hidden beast` number, since 1 + 0 + 1 + 452 + 201 + 5 + 1 + 0 + 0 + 5 = 666.
It is not a de Polignac number, because 10145220151005 - 215 = 10145220118237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10145220151005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 60293419 + ... + 60461448.
It is an arithmetic number, because the mean of its divisors is an integer number (733102803628).
Almost surely, 210145220151005 is an apocalyptic number.
10145220151005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10145220151005 is a deficient number, since it is larger than the sum of its proper divisors (7449247136067).
10145220151005 is a wasteful number, since it uses less digits than its factorization.
10145220151005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120756745 (or 120756742 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
The spelling of 10145220151005 in words is "ten trillion, one hundred forty-five billion, two hundred twenty million, one hundred fifty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •