Base | Representation |
---|---|
bin | 11110000100111011101… |
… | …01001111001111111001 |
3 | 10122210111012221001002220 |
4 | 33002131311033033321 |
5 | 113412441133130131 |
6 | 2110431132314253 |
7 | 134443416111354 |
oct | 17023565171771 |
9 | 3583435831086 |
10 | 1033440130041 |
11 | 369309014600 |
12 | 148355012989 |
13 | 765b7297537 |
14 | 3803970729b |
15 | 1bd373c2e96 |
hex | f09dd4f3f9 |
1033440130041 has 24 divisors (see below), whose sum is σ = 1580424444480. Its totient is φ = 599095722720.
The previous prime is 1033440130033. The next prime is 1033440130043. The reversal of 1033440130041 is 1400310443301.
It is not a de Polignac number, because 1033440130041 - 23 = 1033440130033 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1033440129993 and 1033440130020.
It is not an unprimeable number, because it can be changed into a prime (1033440130043) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61881706 + ... + 61898403.
It is an arithmetic number, because the mean of its divisors is an integer number (65851018520).
Almost surely, 21033440130041 is an apocalyptic number.
1033440130041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1033440130041 is a deficient number, since it is larger than the sum of its proper divisors (546984314439).
1033440130041 is a wasteful number, since it uses less digits than its factorization.
1033440130041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123780157 (or 123780146 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1033440130041 its reverse (1400310443301), we get a palindrome (2433750573342).
The spelling of 1033440130041 in words is "one trillion, thirty-three billion, four hundred forty million, one hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •