Base | Representation |
---|---|
bin | 101101101110011011000001… |
… | …111110100000010100101011 |
3 | 222101001011222000002001000120 |
4 | 231232123001332200110223 |
5 | 202324324313024340243 |
6 | 1551413025321534323 |
7 | 60234104212261023 |
oct | 5556330176402453 |
9 | 871034860061016 |
10 | 201102213121323 |
11 | 59093a73646128 |
12 | 1a67ab583443a3 |
13 | 8829b1b710ca7 |
14 | 3793582dc2a83 |
15 | 183b1e3e9ec83 |
hex | b6e6c1fa052b |
201102213121323 has 8 divisors (see below), whose sum is σ = 268139754637200. Its totient is φ = 134066406843168.
The previous prime is 201102213121319. The next prime is 201102213121387. The reversal of 201102213121323 is 323121312201102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201102213121323 - 22 = 201102213121319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201102213121293 and 201102213121302.
It is not an unprimeable number, because it can be changed into a prime (201102213121723) 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, 433538988 + ... + 434002601.
It is an arithmetic number, because the mean of its divisors is an integer number (33517469329650).
Almost surely, 2201102213121323 is an apocalyptic number.
201102213121323 is a deficient number, since it is larger than the sum of its proper divisors (67037541515877).
201102213121323 is an equidigital number, since it uses as much as digits as its factorization.
201102213121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 867618861.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 201102213121323 its reverse (323121312201102), we get a palindrome (524223525322425).
The spelling of 201102213121323 in words is "two hundred one trillion, one hundred two billion, two hundred thirteen million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •