Base | Representation |
---|---|
bin | 1100000001010001100… |
… | …01111000001101010111 |
3 | 1110111000202021211120221 |
4 | 12000220301320031113 |
5 | 23231311230234333 |
6 | 513421405135211 |
7 | 41560356533035 |
oct | 6005061701527 |
9 | 1414022254527 |
10 | 413001024343 |
11 | 14a175347416 |
12 | 6806125a507 |
13 | 2cc3acab35b |
14 | 15dbcb17555 |
15 | ab22e9dd2d |
hex | 6028c78357 |
413001024343 has 4 divisors (see below), whose sum is σ = 417258766960. Its totient is φ = 408743281728.
The previous prime is 413001024301. The next prime is 413001024347. The reversal of 413001024343 is 343420100314.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 413001024343 - 213 = 413001016151 is a prime.
It is a super-2 number, since 2×4130010243432 (a number of 24 digits) 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 (413001024347) 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 3 ways as a sum of consecutive naturals, for example, 2128871163 + ... + 2128871356.
It is an arithmetic number, because the mean of its divisors is an integer number (104314691740).
Almost surely, 2413001024343 is an apocalyptic number.
413001024343 is a deficient number, since it is larger than the sum of its proper divisors (4257742617).
413001024343 is an equidigital number, since it uses as much as digits as its factorization.
413001024343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4257742616.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 413001024343 its reverse (343420100314), we get a palindrome (756421124657).
The spelling of 413001024343 in words is "four hundred thirteen billion, one million, twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •