Base | Representation |
---|---|
bin | 11101000110111101000… |
… | …010011010000011001111 |
3 | 21002020012112021112001221 |
4 | 131012331002122003033 |
5 | 230233134304124310 |
6 | 4130534534144211 |
7 | 264343034441122 |
oct | 35067502320317 |
9 | 7066175245057 |
10 | 2000331317455 |
11 | 701376975569 |
12 | 283816ab2067 |
13 | 1168270a89c3 |
14 | 6cb608963b9 |
15 | 37077125ada |
hex | 1d1bd09a0cf |
2000331317455 has 8 divisors (see below), whose sum is σ = 2402369977392. Its totient is φ = 1598950123008.
The previous prime is 2000331317431. The next prime is 2000331317489. The reversal of 2000331317455 is 5547131330002.
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 2000331317455 - 29 = 2000331316943 is a prime.
It is a super-4 number, since 4×20003313174554 (a number of 50 digits) contains 4444 as substring.
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 2000331317455.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164359677 + ... + 164371846.
It is an arithmetic number, because the mean of its divisors is an integer number (300296247174).
Almost surely, 22000331317455 is an apocalyptic number.
2000331317455 is a deficient number, since it is larger than the sum of its proper divisors (402038659937).
2000331317455 is a wasteful number, since it uses less digits than its factorization.
2000331317455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328732745.
The product of its (nonzero) digits is 37800, while the sum is 34.
Adding to 2000331317455 its reverse (5547131330002), we get a palindrome (7547462647457).
The spelling of 2000331317455 in words is "two trillion, three hundred thirty-one million, three hundred seventeen thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •