Base | Representation |
---|---|
bin | 101101101101001000000011… |
… | …000001110101111101111001 |
3 | 222100201122222021012202120010 |
4 | 231231020003001311331321 |
5 | 202321344322202432413 |
6 | 1551304051545052133 |
7 | 60224501155044510 |
oct | 5555100301657571 |
9 | 870648867182503 |
10 | 201013110202233 |
11 | 5905a1aa34321a |
12 | 1a66582ba87049 |
13 | 88215bb702824 |
14 | 378d12d2c1677 |
15 | 1838c2b774dc3 |
hex | b6d203075f79 |
201013110202233 has 16 divisors (see below), whose sum is σ = 306305944359296. Its totient is φ = 114864539667840.
The previous prime is 201013110202123. The next prime is 201013110202253. The reversal of 201013110202233 is 332202011310102.
It is not a de Polignac number, because 201013110202233 - 218 = 201013109940089 is a prime.
It is a super-3 number, since 3×2010131102022333 (a number of 44 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (201013110202253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28216623 + ... + 34615083.
It is an arithmetic number, because the mean of its divisors is an integer number (19144121522456).
Almost surely, 2201013110202233 is an apocalyptic number.
It is an amenable number.
201013110202233 is a deficient number, since it is larger than the sum of its proper divisors (105292834157063).
201013110202233 is a wasteful number, since it uses less digits than its factorization.
201013110202233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7894464.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201013110202233 its reverse (332202011310102), we get a palindrome (533215121512335).
The spelling of 201013110202233 in words is "two hundred one trillion, thirteen billion, one hundred ten million, two hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •