Base | Representation |
---|---|
bin | 101101101100111101101101… |
… | …100010011100101010001011 |
3 | 222100200121022211102110212211 |
4 | 231230331231202130222023 |
5 | 202321204110112413311 |
6 | 1551255014421045551 |
7 | 60223626145623232 |
oct | 5554755542345213 |
9 | 870617284373784 |
10 | 201002012232331 |
11 | 59055524880172 |
12 | 1a6636532568b7 |
13 | 88205403c572b |
14 | 378c7993cbb19 |
15 | 18387cc2d2821 |
hex | b6cf6d89ca8b |
201002012232331 has 4 divisors (see below), whose sum is σ = 201011054587200. Its totient is φ = 200992969877464.
The previous prime is 201002012232311. The next prime is 201002012232431. The reversal of 201002012232331 is 133232210200102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201002012232331 - 217 = 201002012101259 is a prime.
It is a super-2 number, since 2×2010020122323312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201002012232311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4521144091 + ... + 4521188548.
It is an arithmetic number, because the mean of its divisors is an integer number (50252763646800).
Almost surely, 2201002012232331 is an apocalyptic number.
201002012232331 is a deficient number, since it is larger than the sum of its proper divisors (9042354869).
201002012232331 is an equidigital number, since it uses as much as digits as its factorization.
201002012232331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9042354868.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 201002012232331 its reverse (133232210200102), we get a palindrome (334234222432433).
The spelling of 201002012232331 in words is "two hundred one trillion, two billion, twelve million, two hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •