Base | Representation |
---|---|
bin | 101101110000000000010111… |
… | …100100001000100101001110 |
3 | 222101102120211011111100011011 |
4 | 231300000113210020211032 |
5 | 202333120133421400220 |
6 | 1551535022404115434 |
7 | 60245005505041261 |
oct | 5560002744104516 |
9 | 871376734440134 |
10 | 201211023231310 |
11 | 59126130065264 |
12 | 1a698064695b7a |
13 | 883716c546361 |
14 | 3798946148cd8 |
15 | 183de618a765a |
hex | b7001790894e |
201211023231310 has 8 divisors (see below), whose sum is σ = 362179841816376. Its totient is φ = 80484409292520.
The previous prime is 201211023231307. The next prime is 201211023231319. The reversal of 201211023231310 is 13132320112102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2012110232313102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201211023231319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10060551161556 + ... + 10060551161575.
It is an arithmetic number, because the mean of its divisors is an integer number (45272480227047).
Almost surely, 2201211023231310 is an apocalyptic number.
201211023231310 is a deficient number, since it is larger than the sum of its proper divisors (160968818585066).
201211023231310 is a wasteful number, since it uses less digits than its factorization.
201211023231310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20121102323138.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 201211023231310 its reverse (13132320112102), we get a palindrome (214343343343412).
The spelling of 201211023231310 in words is "two hundred one trillion, two hundred eleven billion, twenty-three million, two hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •