Base | Representation |
---|---|
bin | 1001001111101111010100… |
… | …11010111001100011100001 |
3 | 2122222201110221202010201110 |
4 | 10213313222122321203201 |
5 | 10131104430330211001 |
6 | 111124221535453533 |
7 | 4165640145050514 |
oct | 447675232714341 |
9 | 78881427663643 |
10 | 20332013132001 |
11 | 65298383a421a |
12 | 23445920872a9 |
13 | b463ba59c0ac |
14 | 504108d20d7b |
15 | 253d37c773d6 |
hex | 127dea6b98e1 |
20332013132001 has 8 divisors (see below), whose sum is σ = 27142131197664. Its totient is φ = 13538285243840.
The previous prime is 20332013131981. The next prime is 20332013132003. The reversal of 20332013132001 is 10023131023302.
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 20332013132001 - 210 = 20332013130977 is a prime.
It is a super-2 number, since 2×203320131320012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20332013132003) 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, 4097541480 + ... + 4097546441.
It is an arithmetic number, because the mean of its divisors is an integer number (3392766399708).
Almost surely, 220332013132001 is an apocalyptic number.
It is an amenable number.
20332013132001 is a deficient number, since it is larger than the sum of its proper divisors (6810118065663).
20332013132001 is an equidigital number, since it uses as much as digits as its factorization.
20332013132001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8195088751.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20332013132001 its reverse (10023131023302), we get a palindrome (30355144155303).
The spelling of 20332013132001 in words is "twenty trillion, three hundred thirty-two billion, thirteen million, one hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •