Base | Representation |
---|---|
bin | 101001111111110… |
… | …0000000000100001 |
3 | 10122012120111101211 |
4 | 1103333200000201 |
5 | 10341220430410 |
6 | 351455030121 |
7 | 46630422631 |
oct | 12377400041 |
9 | 3565514354 |
10 | 1409155105 |
11 | 6634820a6 |
12 | 333b0b341 |
13 | 195c358b7 |
14 | d52166c1 |
15 | 83aa268a |
hex | 53fe0021 |
1409155105 has 8 divisors (see below), whose sum is σ = 1714803264. Its totient is φ = 1111446000.
The previous prime is 1409155093. The next prime is 1409155123. The reversal of 1409155105 is 5015519041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1409155105 - 27 = 1409154977 is a prime.
It is a super-3 number, since 3×14091551053 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 1984371 + ... + 1985080.
It is an arithmetic number, because the mean of its divisors is an integer number (214350408).
Almost surely, 21409155105 is an apocalyptic number.
It is an amenable number.
1409155105 is a deficient number, since it is larger than the sum of its proper divisors (305648159).
1409155105 is an equidigital number, since it uses as much as digits as its factorization.
1409155105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3969527.
The product of its (nonzero) digits is 4500, while the sum is 31.
The square root of 1409155105 is about 37538.7147489096. The cubic root of 1409155105 is about 1121.1221493968.
It can be divided in two parts, 14091 and 55105, that added together give a palindrome (69196).
The spelling of 1409155105 in words is "one billion, four hundred nine million, one hundred fifty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •