Base | Representation |
---|---|
bin | 101111000011100001… |
… | …1001010011011111001 |
3 | 100122211100101221001000 |
4 | 1132013003022123321 |
5 | 3123422300014040 |
6 | 114231032115213 |
7 | 10205053560222 |
oct | 1360703123371 |
9 | 318740357030 |
10 | 101050001145 |
11 | 39945100545 |
12 | 17701535b09 |
13 | 96b52056b2 |
14 | 4c686a6249 |
15 | 29664e6130 |
hex | 17870ca6f9 |
101050001145 has 64 divisors (see below), whose sum is σ = 180557786880. Its totient is φ = 53619955200.
The previous prime is 101050001141. The next prime is 101050001201. The reversal of 101050001145 is 541100050101.
It is a happy number.
101050001145 is a `hidden beast` number, since 10 + 10 + 500 + 0 + 1 + 145 = 666.
It is not a de Polignac number, because 101050001145 - 22 = 101050001141 is a prime.
It is a super-2 number, since 2×1010500011452 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101050001141) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31370635 + ... + 31373855.
It is an arithmetic number, because the mean of its divisors is an integer number (2821215420).
Almost surely, 2101050001145 is an apocalyptic number.
101050001145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101050001145 is a deficient number, since it is larger than the sum of its proper divisors (79507785735).
101050001145 is a wasteful number, since it uses less digits than its factorization.
101050001145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4343 (or 4337 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
Adding to 101050001145 its reverse (541100050101), we get a palindrome (642150051246).
The spelling of 101050001145 in words is "one hundred one billion, fifty million, one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.457 sec. • engine limits •