Base | Representation |
---|---|
bin | 11110010100111101010… |
… | …00001111010100111101 |
3 | 10200121200210120011212102 |
4 | 33022132220033110331 |
5 | 114033101104344201 |
6 | 2114412543114445 |
7 | 135166544022152 |
oct | 17123650172475 |
9 | 3617623504772 |
10 | 1042043434301 |
11 | 371a23397411 |
12 | 149b562a2a25 |
13 | 773587c220c |
14 | 38614178229 |
15 | 1c18c84026b |
hex | f29ea0f53d |
1042043434301 has 8 divisors (see below), whose sum is σ = 1110772483200. Its totient is φ = 974702851200.
The previous prime is 1042043434297. The next prime is 1042043434337. The reversal of 1042043434301 is 1034343402401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1042043434301 - 22 = 1042043434297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042043434381) 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, 347114900 + ... + 347117901.
It is an arithmetic number, because the mean of its divisors is an integer number (138846560400).
Almost surely, 21042043434301 is an apocalyptic number.
It is an amenable number.
1042043434301 is a deficient number, since it is larger than the sum of its proper divisors (68729048899).
1042043434301 is an equidigital number, since it uses as much as digits as its factorization.
1042043434301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694232899.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 1042043434301 its reverse (1034343402401), we get a palindrome (2076386836702).
The spelling of 1042043434301 in words is "one trillion, forty-two billion, forty-three million, four hundred thirty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •