Base | Representation |
---|---|
bin | 101001111000000… |
… | …0101100000111111 |
3 | 10121220222012122020 |
4 | 1103300011200333 |
5 | 10334202130211 |
6 | 351232251223 |
7 | 46551163350 |
oct | 12360054077 |
9 | 3556865566 |
10 | 1405114431 |
11 | 6611722a6 |
12 | 3326a0b13 |
13 | 19514c676 |
14 | d4883d27 |
15 | 83555306 |
hex | 53c0583f |
1405114431 has 8 divisors (see below), whose sum is σ = 2141126784. Its totient is φ = 802922520.
The previous prime is 1405114427. The next prime is 1405114457. The reversal of 1405114431 is 1344115041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1405114431 - 22 = 1405114427 is a prime.
It is a super-2 number, since 2×14051144312 = 3948693128408907522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1405114421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33455085 + ... + 33455126.
It is an arithmetic number, because the mean of its divisors is an integer number (267640848).
Almost surely, 21405114431 is an apocalyptic number.
1405114431 is a deficient number, since it is larger than the sum of its proper divisors (736012353).
1405114431 is an equidigital number, since it uses as much as digits as its factorization.
1405114431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66910221.
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 1405114431 is about 37484.8560221325. The cubic root of 1405114431 is about 1120.0495383594.
Adding to 1405114431 its reverse (1344115041), we get a palindrome (2749229472).
It can be divided in two parts, 14051 and 14431, that added together give a palindrome (28482).
The spelling of 1405114431 in words is "one billion, four hundred five million, one hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •