Base | Representation |
---|---|
bin | 1100000001111000111… |
… | …01011100111100111111 |
3 | 1110111212202121012211210 |
4 | 12000330131130330333 |
5 | 23233000242323033 |
6 | 513514242215503 |
7 | 41601506231361 |
oct | 6007435347477 |
9 | 1414782535753 |
10 | 413331214143 |
11 | 14a324770951 |
12 | 68133954593 |
13 | 2cc91519633 |
14 | 16010908d31 |
15 | ab41e72d63 |
hex | 603c75cf3f |
413331214143 has 8 divisors (see below), whose sum is σ = 551118601648. Its totient is φ = 275548984704.
The previous prime is 413331214117. The next prime is 413331214157. The reversal of 413331214143 is 341412133314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 413331214143 - 214 = 413331197759 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 413331214143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413331214243) 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, 1098496 + ... + 1425957.
It is an arithmetic number, because the mean of its divisors is an integer number (68889825206).
Almost surely, 2413331214143 is an apocalyptic number.
413331214143 is a deficient number, since it is larger than the sum of its proper divisors (137787387505).
413331214143 is a wasteful number, since it uses less digits than its factorization.
413331214143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2579033.
The product of its digits is 10368, while the sum is 30.
Adding to 413331214143 its reverse (341412133314), we get a palindrome (754743347457).
The spelling of 413331214143 in words is "four hundred thirteen billion, three hundred thirty-one million, two hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •