Base | Representation |
---|---|
bin | 10000110101010000110… |
… | …111111001110110000000 |
3 | 11002120122121211101101222 |
4 | 100311100313321312000 |
5 | 122422411434103002 |
6 | 2243214304214212 |
7 | 146366115366446 |
oct | 20652067716600 |
9 | 4076577741358 |
10 | 1156703034752 |
11 | 406611787291 |
12 | 16821560a368 |
13 | 850cc476545 |
14 | 3ddb0130b96 |
15 | 2014da501a2 |
hex | 10d50df9d80 |
1156703034752 has 96 divisors (see below), whose sum is σ = 2364764346360. Its totient is φ = 563528970240.
The previous prime is 1156703034743. The next prime is 1156703034761. The reversal of 1156703034752 is 2574303076511.
It is an interprime number because it is at equal distance from previous prime (1156703034743) and next prime (1156703034761).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50951468 + ... + 50974164.
Almost surely, 21156703034752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1156703034752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1182382173180).
1156703034752 is an abundant number, since it is smaller than the sum of its proper divisors (1208061311608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156703034752 is an equidigital number, since it uses as much as digits as its factorization.
1156703034752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22940 (or 22867 counting only the distinct ones).
The product of its (nonzero) digits is 529200, while the sum is 44.
The spelling of 1156703034752 in words is "one trillion, one hundred fifty-six billion, seven hundred three million, thirty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •