Base | Representation |
---|---|
bin | 101001111000000… |
… | …1001110101111011 |
3 | 10121221000002221200 |
4 | 1103300021311323 |
5 | 10334203212110 |
6 | 351232505243 |
7 | 46551266130 |
oct | 12360116573 |
9 | 3557002850 |
10 | 1405132155 |
11 | 661184649 |
12 | 3326ab223 |
13 | 19515775b |
14 | d488a587 |
15 | 8355a6c0 |
hex | 53c09d7b |
1405132155 has 48 divisors (see below), whose sum is σ = 2800272384. Its totient is φ = 638475840.
The previous prime is 1405132153. The next prime is 1405132159. The reversal of 1405132155 is 5512315041.
1405132155 is a `hidden beast` number, since 140 + 513 + 2 + 1 + 5 + 5 = 666.
It is not a de Polignac number, because 1405132155 - 21 = 1405132153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1405132153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 39250 + ... + 65960.
It is an arithmetic number, because the mean of its divisors is an integer number (58339008).
Almost surely, 21405132155 is an apocalyptic number.
1405132155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1405132155 is a deficient number, since it is larger than the sum of its proper divisors (1395140229).
1405132155 is a wasteful number, since it uses less digits than its factorization.
1405132155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26896 (or 26893 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The square root of 1405132155 is about 37485.0924368608. The cubic root of 1405132155 is about 1120.0542477445.
Adding to 1405132155 its reverse (5512315041), we get a palindrome (6917447196).
The spelling of 1405132155 in words is "one billion, four hundred five million, one hundred thirty-two thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •