Base | Representation |
---|---|
bin | 101101101101010001011000… |
… | …010100111010101101001011 |
3 | 222100202121211122111012122211 |
4 | 231231101120110322231023 |
5 | 202322030333041402311 |
6 | 1551312430201525551 |
7 | 60225304406113426 |
oct | 5555213024725513 |
9 | 870677748435584 |
10 | 201023131200331 |
11 | 5906348199a430 |
12 | 1a667767aa38b7 |
13 | 88225278627bb |
14 | 378d80014c9bd |
15 | 18391163ce821 |
hex | b6d45853ab4b |
201023131200331 has 8 divisors (see below), whose sum is σ = 219299670871344. Its totient is φ = 182746876456320.
The previous prime is 201023131200301. The next prime is 201023131200373. The reversal of 201023131200331 is 133002131320102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201023131200331 - 25 = 201023131200299 is a prime.
It is a super-2 number, since 2×2010231312003312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201023131200301) 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, 69755226 + ... + 72579871.
It is an arithmetic number, because the mean of its divisors is an integer number (27412458858918).
Almost surely, 2201023131200331 is an apocalyptic number.
201023131200331 is a deficient number, since it is larger than the sum of its proper divisors (18276539671013).
201023131200331 is a wasteful number, since it uses less digits than its factorization.
201023131200331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142463501.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 201023131200331 its reverse (133002131320102), we get a palindrome (334025262520433).
The spelling of 201023131200331 in words is "two hundred one trillion, twenty-three billion, one hundred thirty-one million, two hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •