Base | Representation |
---|---|
bin | 11110000010010101010… |
… | …00101110001110000101 |
3 | 10122122212221111120021012 |
4 | 33001022220232032011 |
5 | 113402111322340401 |
6 | 2110040431532005 |
7 | 134364010102055 |
oct | 17011250561605 |
9 | 3578787446235 |
10 | 1032044340101 |
11 | 3687621409a5 |
12 | 14802568a005 |
13 | 76424061128 |
14 | 37d461ad565 |
15 | 1bca4ab08bb |
hex | f04aa2e385 |
1032044340101 has 4 divisors (see below), whose sum is σ = 1059937430412. Its totient is φ = 1004151249792.
The previous prime is 1032044340083. The next prime is 1032044340139. The reversal of 1032044340101 is 1010434402301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 855643500100 + 176400840001 = 925010^2 + 420001^2 .
It is a cyclic number.
It is not a de Polignac number, because 1032044340101 - 222 = 1032040145797 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 (1032044340161) 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, 13946545100 + ... + 13946545173.
It is an arithmetic number, because the mean of its divisors is an integer number (264984357603).
Almost surely, 21032044340101 is an apocalyptic number.
It is an amenable number.
1032044340101 is a deficient number, since it is larger than the sum of its proper divisors (27893090311).
1032044340101 is an equidigital number, since it uses as much as digits as its factorization.
1032044340101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27893090310.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1032044340101 its reverse (1010434402301), we get a palindrome (2042478742402).
The spelling of 1032044340101 in words is "one trillion, thirty-two billion, forty-four million, three hundred forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •