Base | Representation |
---|---|
bin | 11110010101010000010… |
… | …01100011001100111001 |
3 | 10200122002221010011020221 |
4 | 33022220021203030321 |
5 | 114033413002131101 |
6 | 2114440450420041 |
7 | 135203523463633 |
oct | 17125011431471 |
9 | 3618087104227 |
10 | 1042203161401 |
11 | 371aa5572786 |
12 | 149b9b891621 |
13 | 773829186ac |
14 | 3862b475a53 |
15 | 1c19b891aa1 |
hex | f2a8263339 |
1042203161401 has 4 divisors (see below), whose sum is σ = 1042216878672. Its totient is φ = 1042189444132.
The previous prime is 1042203161393. The next prime is 1042203161453. The reversal of 1042203161401 is 1041613022401.
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 1042203161401 - 23 = 1042203161393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1042203161471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6744031 + ... + 6896836.
It is an arithmetic number, because the mean of its divisors is an integer number (260554219668).
Almost surely, 21042203161401 is an apocalyptic number.
It is an amenable number.
1042203161401 is a deficient number, since it is larger than the sum of its proper divisors (13717271).
1042203161401 is an equidigital number, since it uses as much as digits as its factorization.
1042203161401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13717270.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1042203161401 its reverse (1041613022401), we get a palindrome (2083816183802).
The spelling of 1042203161401 in words is "one trillion, forty-two billion, two hundred three million, one hundred sixty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •