Base | Representation |
---|---|
bin | 11101001110100000011… |
… | …00001001000000110101 |
3 | 10120000001211111222211122 |
4 | 32213100030021000311 |
5 | 112423120334123131 |
6 | 2045155444313325 |
7 | 132360341026523 |
oct | 16472014110065 |
9 | 3500054458748 |
10 | 1004220223541 |
11 | 357984155347 |
12 | 14275b3a2845 |
13 | 7390b705632 |
14 | 36866b25313 |
15 | 1b1c6edcd7b |
hex | e9d0309035 |
1004220223541 has 8 divisors (see below), whose sum is σ = 1029172304160. Its totient is φ = 979340784912.
The previous prime is 1004220223537. The next prime is 1004220223549. The reversal of 1004220223541 is 1453220224001.
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 1004220223541 - 22 = 1004220223537 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1004220223541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004220223549) 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, 18132506 + ... + 18187803.
It is an arithmetic number, because the mean of its divisors is an integer number (128646538020).
Almost surely, 21004220223541 is an apocalyptic number.
It is an amenable number.
1004220223541 is a deficient number, since it is larger than the sum of its proper divisors (24952080619).
1004220223541 is an equidigital number, since it uses as much as digits as its factorization.
1004220223541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36320995.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 1004220223541 its reverse (1453220224001), we get a palindrome (2457440447542).
The spelling of 1004220223541 in words is "one trillion, four billion, two hundred twenty million, two hundred twenty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •