Base | Representation |
---|---|
bin | 101101100001010011110111… |
… | …010101001100110111100001 |
3 | 222020212001012102022112122110 |
4 | 231201103313111030313201 |
5 | 202220043441233144413 |
6 | 1545443051240225533 |
7 | 60112025334602550 |
oct | 5541236725146741 |
9 | 866761172275573 |
10 | 200201165131233 |
11 | 58876923534922 |
12 | 1a5543b116b2a9 |
13 | 8792b72ab4406 |
14 | 3761b06759d97 |
15 | 1822a599628c3 |
hex | b614f754cde1 |
200201165131233 has 16 divisors (see below), whose sum is σ = 305074580535296. Its totient is φ = 114398363877840.
The previous prime is 200201165131213. The next prime is 200201165131243. The reversal of 200201165131233 is 332131561102002.
It is not a de Polignac number, because 200201165131233 - 226 = 200201098022369 is a prime.
It is a super-2 number, since 2×2002011651312332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200201165131233.
It is not an unprimeable number, because it can be changed into a prime (200201165131213) 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, 94844191 + ... + 96932052.
It is an arithmetic number, because the mean of its divisors is an integer number (19067161283456).
Almost surely, 2200201165131233 is an apocalyptic number.
It is an amenable number.
200201165131233 is a deficient number, since it is larger than the sum of its proper divisors (104873415404063).
200201165131233 is a wasteful number, since it uses less digits than its factorization.
200201165131233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191825964.
The product of its (nonzero) digits is 6480, while the sum is 30.
The spelling of 200201165131233 in words is "two hundred trillion, two hundred one billion, one hundred sixty-five million, one hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •