Base | Representation |
---|---|
bin | 11101011011111100010… |
… | …00010011101001011001 |
3 | 10120200200112102102002221 |
4 | 32231332020103221121 |
5 | 113032403423441101 |
6 | 2052351320224041 |
7 | 133034156142064 |
oct | 16557610235131 |
9 | 3520615372087 |
10 | 1011433421401 |
11 | 35aa45886697 |
12 | 14403300b021 |
13 | 744bac36b50 |
14 | 36d4cadb8db |
15 | 1b49a3bbaa1 |
hex | eb7e213a59 |
1011433421401 has 8 divisors (see below), whose sum is σ = 1089404149064. Its totient is φ = 933486716160.
The previous prime is 1011433421389. The next prime is 1011433421407. The reversal of 1011433421401 is 1041243341101.
It can be written as a sum of positive squares in 4 ways, for example, as 298827315801 + 712606105600 = 546651^2 + 844160^2 .
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 1011433421401 - 213 = 1011433413209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011433421407) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5918106 + ... + 6086611.
It is an arithmetic number, because the mean of its divisors is an integer number (136175518633).
Almost surely, 21011433421401 is an apocalyptic number.
It is an amenable number.
1011433421401 is a deficient number, since it is larger than the sum of its proper divisors (77970727663).
1011433421401 is a wasteful number, since it uses less digits than its factorization.
1011433421401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12011211.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1011433421401 its reverse (1041243341101), we get a palindrome (2052676762502).
The spelling of 1011433421401 in words is "one trillion, eleven billion, four hundred thirty-three million, four hundred twenty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •