Base | Representation |
---|---|
bin | 1001100100111010… |
… | …11101010000111101 |
3 | 111021022201210212000 |
4 | 10302131131100331 |
5 | 41012214101031 |
6 | 2210105132513 |
7 | 241261312050 |
oct | 46235352075 |
9 | 14238653760 |
10 | 5141550141 |
11 | 21a92a87a2 |
12 | bb5a8a139 |
13 | 63c28c680 |
14 | 36abcaa97 |
15 | 2015b73e6 |
hex | 13275d43d |
5141550141 has 32 divisors (see below), whose sum is σ = 9374910720. Its totient is φ = 2712025152.
The previous prime is 5141550133. The next prime is 5141550163. The reversal of 5141550141 is 1410551415.
5141550141 is a `hidden beast` number, since 514 + 1 + 5 + 5 + 0 + 141 = 666.
5141550141 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5141550141 - 23 = 5141550133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5141550191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1043850 + ... + 1048763.
It is an arithmetic number, because the mean of its divisors is an integer number (292965960).
Almost surely, 25141550141 is an apocalyptic number.
It is an amenable number.
5141550141 is a deficient number, since it is larger than the sum of its proper divisors (4233360579).
5141550141 is a wasteful number, since it uses less digits than its factorization.
5141550141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2092642 (or 2092636 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
The square root of 5141550141 is about 71704.6033459498. The cubic root of 5141550141 is about 1725.9625116113.
The spelling of 5141550141 in words is "five billion, one hundred forty-one million, five hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •