Base | Representation |
---|---|
bin | 10010010011001110111111… |
… | …01111010111101001001001 |
3 | 12021111012222221012010120001 |
4 | 21021213133233113221021 |
5 | 20233321240344124001 |
6 | 221331303505403001 |
7 | 11322324355541365 |
oct | 1111473757275111 |
9 | 167435887163501 |
10 | 40243302333001 |
11 | 119060a8031a39 |
12 | 461b508639461 |
13 | 195bc08b87391 |
14 | 9d1b015902a5 |
15 | 49bc49a3c001 |
hex | 2499dfbd7a49 |
40243302333001 has 4 divisors (see below), whose sum is σ = 41993011130112. Its totient is φ = 38493593535892.
The previous prime is 40243302332993. The next prime is 40243302333043. The reversal of 40243302333001 is 10033320334204.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40243302333001 - 23 = 40243302332993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40243302333061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 874854398521 + ... + 874854398566.
It is an arithmetic number, because the mean of its divisors is an integer number (10498252782528).
Almost surely, 240243302333001 is an apocalyptic number.
It is an amenable number.
40243302333001 is a deficient number, since it is larger than the sum of its proper divisors (1749708797111).
40243302333001 is a wasteful number, since it uses less digits than its factorization.
40243302333001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1749708797110.
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 40243302333001 its reverse (10033320334204), we get a palindrome (50276622667205).
The spelling of 40243302333001 in words is "forty trillion, two hundred forty-three billion, three hundred two million, three hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •