Base | Representation |
---|---|
bin | 11110010011101000100… |
… | …10001110010110000001 |
3 | 10200112212021210101200212 |
4 | 33021310102032112001 |
5 | 114030122223120113 |
6 | 2114214244323505 |
7 | 135143126424425 |
oct | 17116422162601 |
9 | 3615767711625 |
10 | 1041333020033 |
11 | 371699384689 |
12 | 1499983a3595 |
13 | 77274577847 |
14 | 38587a8cb85 |
15 | 1c14a2b20a8 |
hex | f27448e581 |
1041333020033 has 12 divisors (see below), whose sum is σ = 1076169279024. Its totient is φ = 1007590588200.
The previous prime is 1041333020029. The next prime is 1041333020051. The reversal of 1041333020033 is 3300203331401.
It is not a de Polignac number, because 1041333020033 - 22 = 1041333020029 is a prime.
It is a super-2 number, since 2×10413330200332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1041333019990 and 1041333020008.
It is not an unprimeable number, because it can be changed into a prime (1041333020633) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6621410 + ... + 6776852.
It is an arithmetic number, because the mean of its divisors is an integer number (89680773252).
Almost surely, 21041333020033 is an apocalyptic number.
It is an amenable number.
1041333020033 is a deficient number, since it is larger than the sum of its proper divisors (34836258991).
1041333020033 is an equidigital number, since it uses as much as digits as its factorization.
1041333020033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162476 (or 162445 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 1041333020033 its reverse (3300203331401), we get a palindrome (4341536351434).
The spelling of 1041333020033 in words is "one trillion, forty-one billion, three hundred thirty-three million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •