Base | Representation |
---|---|
bin | 1110001100000010111101… |
… | …01100010000111100101001 |
3 | 11002110201020202020222100021 |
4 | 13012001132230100330221 |
5 | 13042141033130201301 |
6 | 150205104401040441 |
7 | 6400066545406612 |
oct | 706013654207451 |
9 | 132421222228307 |
10 | 31200231100201 |
11 | 9a39a42082149 |
12 | 35ba992326121 |
13 | 145422787cc27 |
14 | 79c156470c09 |
15 | 3918c9e138a1 |
hex | 1c605eb10f29 |
31200231100201 has 8 divisors (see below), whose sum is σ = 31203479239200. Its totient is φ = 31196983168128.
The previous prime is 31200231100183. The next prime is 31200231100217. The reversal of 31200231100201 is 10200113200213.
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 31200231100201 - 25 = 31200231100169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31200231160201) 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, 577231225 + ... + 577285273.
It is an arithmetic number, because the mean of its divisors is an integer number (3900434904900).
Almost surely, 231200231100201 is an apocalyptic number.
It is an amenable number.
31200231100201 is a deficient number, since it is larger than the sum of its proper divisors (3248138999).
31200231100201 is a wasteful number, since it uses less digits than its factorization.
31200231100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103463.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 31200231100201 its reverse (10200113200213), we get a palindrome (41400344300414).
It can be divided in two parts, 3120023 and 1100201, that added together give a palindrome (4220224).
The spelling of 31200231100201 in words is "thirty-one trillion, two hundred billion, two hundred thirty-one million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •