Base | Representation |
---|---|
bin | 10000110100001100011… |
… | …100100000001010111110 |
3 | 11002110200121121020012012 |
4 | 100310030130200022332 |
5 | 122413034040013042 |
6 | 2242504334011222 |
7 | 146325505305362 |
oct | 20641434401276 |
9 | 4073617536165 |
10 | 1155555001022 |
11 | 406082744584 |
12 | 167b55046b12 |
13 | 84c78678446 |
14 | 3dd0188b2a2 |
15 | 200d2d7be82 |
hex | 10d0c7202be |
1155555001022 has 8 divisors (see below), whose sum is σ = 1733395315872. Its totient is φ = 577756562400.
The previous prime is 1155555001021. The next prime is 1155555001057. The reversal of 1155555001022 is 2201005555511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1155555001022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1155555001021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10399979 + ... + 10510502.
It is an arithmetic number, because the mean of its divisors is an integer number (216674414484).
Almost surely, 21155555001022 is an apocalyptic number.
1155555001022 is a deficient number, since it is larger than the sum of its proper divisors (577840314850).
1155555001022 is a wasteful number, since it uses less digits than its factorization.
1155555001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20938114.
The product of its (nonzero) digits is 12500, while the sum is 32.
The spelling of 1155555001022 in words is "one trillion, one hundred fifty-five billion, five hundred fifty-five million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •