Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …111010011111110010001111 |
3 | 222100200112021010221222001011 |
4 | 231230330331322133302033 |
5 | 202321200441041331343 |
6 | 1551254403235430051 |
7 | 60223600304334100 |
oct | 5554747572376217 |
9 | 870615233858034 |
10 | 201001213230223 |
11 | 5905515486104a |
12 | 1a66346b755327 |
13 | 8820443a01b13 |
14 | 378c7212423a7 |
15 | 18387820a629d |
hex | b6cf3de9fc8f |
201001213230223 has 12 divisors (see below), whose sum is σ = 233865426827280. Its totient is φ = 172251614943072.
The previous prime is 201001213230221. The next prime is 201001213230263. The reversal of 201001213230223 is 322032312100102.
It is not a de Polignac number, because 201001213230223 - 21 = 201001213230221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201001213230194 and 201001213230203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201001213230221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 418081758 + ... + 418562251.
It is an arithmetic number, because the mean of its divisors is an integer number (19488785568940).
Almost surely, 2201001213230223 is an apocalyptic number.
201001213230223 is a deficient number, since it is larger than the sum of its proper divisors (32864213597057).
201001213230223 is an equidigital number, since it uses as much as digits as its factorization.
201001213230223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 836648926 (or 836648919 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 201001213230223 its reverse (322032312100102), we get a palindrome (523033525330325).
The spelling of 201001213230223 in words is "two hundred one trillion, one billion, two hundred thirteen million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •