Base | Representation |
---|---|
bin | 11101001110100000100… |
… | …11000101110101011101 |
3 | 10120000001221221120010211 |
4 | 32213100103011311131 |
5 | 112423121320424113 |
6 | 2045155551332421 |
7 | 132360362355460 |
oct | 16472023056535 |
9 | 3500057846124 |
10 | 1004222045533 |
11 | 35798518a223 |
12 | 14275bb21111 |
13 | 7390bbc2a35 |
14 | 3686707b2d7 |
15 | 1b1c724cb3d |
hex | e9d04c5d5d |
1004222045533 has 8 divisors (see below), whose sum is σ = 1147831623360. Its totient is φ = 860649789120.
The previous prime is 1004222045507. The next prime is 1004222045539. The reversal of 1004222045533 is 3355402224001.
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 1004222045533 - 229 = 1003685174621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1004222045495 and 1004222045504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004222045539) 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, 9272668 + ... + 9380341.
It is an arithmetic number, because the mean of its divisors is an integer number (143478952920).
Almost surely, 21004222045533 is an apocalyptic number.
It is an amenable number.
1004222045533 is a deficient number, since it is larger than the sum of its proper divisors (143609577827).
1004222045533 is an equidigital number, since it uses as much as digits as its factorization.
1004222045533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18660707.
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 1004222045533 its reverse (3355402224001), we get a palindrome (4359624269534).
The spelling of 1004222045533 in words is "one trillion, four billion, two hundred twenty-two million, forty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •