Base | Representation |
---|---|
bin | 11000000100011… |
… | …11001100101011 |
3 | 112001221020202010 |
4 | 30002033030223 |
5 | 403142210011 |
6 | 32011411003 |
7 | 5001143010 |
oct | 1402171453 |
9 | 461836663 |
10 | 201913131 |
11 | a3a7a362 |
12 | 57753a63 |
13 | 32aa7034 |
14 | 1cb5d707 |
15 | 12ad61a6 |
hex | c08f32b |
201913131 has 16 divisors (see below), whose sum is σ = 325776384. Its totient is φ = 108591744.
The previous prime is 201913121. The next prime is 201913139. The reversal of 201913131 is 131319102.
It is not a de Polignac number, because 201913131 - 25 = 201913099 is a prime.
It is a super-2 number, since 2×2019131312 = 81537824940446322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 201913098 and 201913107.
It is not an unprimeable number, because it can be changed into a prime (201913139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 282435 + ... + 283148.
It is an arithmetic number, because the mean of its divisors is an integer number (20361024).
Almost surely, 2201913131 is an apocalyptic number.
201913131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201913131 is a deficient number, since it is larger than the sum of its proper divisors (123863253).
201913131 is a wasteful number, since it uses less digits than its factorization.
201913131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565610.
The product of its (nonzero) digits is 162, while the sum is 21.
The square root of 201913131 is about 14209.6140341671. The cubic root of 201913131 is about 586.6623097487.
The spelling of 201913131 in words is "two hundred one million, nine hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •