Base | Representation |
---|---|
bin | 1100101110001110… |
… | …1111011111101111 |
3 | 22211000012022102210 |
4 | 3023203233133233 |
5 | 23443234110211 |
6 | 1322514221503 |
7 | 150426151206 |
oct | 31343573757 |
9 | 8730168383 |
10 | 3415144431 |
11 | 14a283a616 |
12 | 7b3884893 |
13 | 4256c912a |
14 | 2457d023d |
15 | 14ec499a6 |
hex | cb8ef7ef |
3415144431 has 8 divisors (see below), whose sum is σ = 4554169984. Its totient is φ = 2276440920.
The previous prime is 3415144393. The next prime is 3415144441. The reversal of 3415144431 is 1344415143.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3415144431 - 211 = 3415142383 is a prime.
It is a super-2 number, since 2×34151444312 = 23326422969180627522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3415144441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54571 + ... + 99036.
It is an arithmetic number, because the mean of its divisors is an integer number (569271248).
Almost surely, 23415144431 is an apocalyptic number.
3415144431 is a deficient number, since it is larger than the sum of its proper divisors (1139025553).
3415144431 is a wasteful number, since it uses less digits than its factorization.
3415144431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161021.
The product of its digits is 11520, while the sum is 30.
The square root of 3415144431 is about 58439.2370843426. The cubic root of 3415144431 is about 1505.9238972741.
Adding to 3415144431 its reverse (1344415143), we get a palindrome (4759559574).
The spelling of 3415144431 in words is "three billion, four hundred fifteen million, one hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •