Base | Representation |
---|---|
bin | 1001010000110011100110… |
… | …10110100001100010101111 |
3 | 2200010020002122111020101211 |
4 | 10220121303112201202233 |
5 | 10132210014032431111 |
6 | 111153123220015251 |
7 | 4201405431026014 |
oct | 450316326414257 |
9 | 80106078436354 |
10 | 20368670202031 |
11 | 6543339356518 |
12 | 234b702531527 |
13 | b499acbbac88 |
14 | 505bc553970b |
15 | 254c8102b521 |
hex | 1286735a18af |
20368670202031 has 8 divisors (see below), whose sum is σ = 20398700885904. Its totient is φ = 20338658298240.
The previous prime is 20368670201939. The next prime is 20368670202061. The reversal of 20368670202031 is 13020207686302.
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 20368670202031 - 221 = 20368668104879 is a prime.
It is a super-2 number, since 2×203686702020312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20368670202061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2523505 + ... + 6863338.
It is an arithmetic number, because the mean of its divisors is an integer number (2549837610738).
Almost surely, 220368670202031 is an apocalyptic number.
20368670202031 is a deficient number, since it is larger than the sum of its proper divisors (30030683873).
20368670202031 is an equidigital number, since it uses as much as digits as its factorization.
20368670202031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9390041.
The product of its (nonzero) digits is 145152, while the sum is 40.
Adding to 20368670202031 its reverse (13020207686302), we get a palindrome (33388877888333).
The spelling of 20368670202031 in words is "twenty trillion, three hundred sixty-eight billion, six hundred seventy million, two hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •