Base | Representation |
---|---|
bin | 11101000110111100000… |
… | …110111001110001010111 |
3 | 21002020011102221000122212 |
4 | 131012330012321301113 |
5 | 230233121310444433 |
6 | 4130533215544035 |
7 | 264342455032616 |
oct | 35067406716127 |
9 | 7066142830585 |
10 | 2000315718743 |
11 | 701369090a71 |
12 | 28381182b01b |
13 | 116823aa69b4 |
14 | 6cb5c79587d |
15 | 37075a93d48 |
hex | 1d1bc1b9c57 |
2000315718743 has 32 divisors (see below), whose sum is σ = 2132125535232. Its totient is φ = 1872570585600.
The previous prime is 2000315718703. The next prime is 2000315718761. The reversal of 2000315718743 is 3478175130002.
It is a cyclic number.
It is not a de Polignac number, because 2000315718743 - 224 = 2000298941527 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 2000315718743.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000315718703) 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 31 ways as a sum of consecutive naturals, for example, 624511580 + ... + 624514782.
It is an arithmetic number, because the mean of its divisors is an integer number (66628922976).
Almost surely, 22000315718743 is an apocalyptic number.
2000315718743 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2000315718743 is a deficient number, since it is larger than the sum of its proper divisors (131809816489).
2000315718743 is a wasteful number, since it uses less digits than its factorization.
2000315718743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5375.
The product of its (nonzero) digits is 141120, while the sum is 41.
The spelling of 2000315718743 in words is "two trillion, three hundred fifteen million, seven hundred eighteen thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •