Base | Representation |
---|---|
bin | 11110010001111100111… |
… | …11100101001111000001 |
3 | 10200110112101122021021221 |
4 | 33020332133211033001 |
5 | 114021300210131001 |
6 | 2113544525315041 |
7 | 135111560526331 |
oct | 17107637451701 |
9 | 3613471567257 |
10 | 1040430552001 |
11 | 371275a17035 |
12 | 149786105a81 |
13 | 7715c5c89a9 |
14 | 384ddc8d0c1 |
15 | 1c0e5e491a1 |
hex | f23e7e53c1 |
1040430552001 has 4 divisors (see below), whose sum is σ = 1073992827904. Its totient is φ = 1006868276100.
The previous prime is 1040430551999. The next prime is 1040430552059. The reversal of 1040430552001 is 1002550340401.
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 1040430552001 - 21 = 1040430551999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1040430552401) 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 3 ways as a sum of consecutive naturals, for example, 16781137905 + ... + 16781137966.
It is an arithmetic number, because the mean of its divisors is an integer number (268498206976).
Almost surely, 21040430552001 is an apocalyptic number.
It is an amenable number.
1040430552001 is a deficient number, since it is larger than the sum of its proper divisors (33562275903).
1040430552001 is an equidigital number, since it uses as much as digits as its factorization.
1040430552001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33562275902.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 1040430552001 its reverse (1002550340401), we get a palindrome (2042980892402).
The spelling of 1040430552001 in words is "one trillion, forty billion, four hundred thirty million, five hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •