Base | Representation |
---|---|
bin | 11111001101110011101… |
… | …10011110001100100010 |
3 | 10210112110220010100200020 |
4 | 33212321312132030202 |
5 | 120033103104433442 |
6 | 2140421324334310 |
7 | 140330105255562 |
oct | 17467166361442 |
9 | 3715426110606 |
10 | 1072564921122 |
11 | 383965a33192 |
12 | 153a539a4396 |
13 | 7a1b0c234a6 |
14 | 39cab96cda2 |
15 | 1cd771289ec |
hex | f9b9d9e322 |
1072564921122 has 8 divisors (see below), whose sum is σ = 2145129842256. Its totient is φ = 357521640372.
The previous prime is 1072564921121. The next prime is 1072564921123. The reversal of 1072564921122 is 2211294652701.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1072564921121) and next prime (1072564921123).
It is a sphenic number, since it is the product of 3 distinct primes.
1072564921122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (1072564921121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 89380410088 + ... + 89380410099.
It is an arithmetic number, because the mean of its divisors is an integer number (268141230282).
Almost surely, 21072564921122 is an apocalyptic number.
1072564921122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1072564921122 is a wasteful number, since it uses less digits than its factorization.
1072564921122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178760820192.
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 1072564921122 in words is "one trillion, seventy-two billion, five hundred sixty-four million, nine hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •