Base | Representation |
---|---|
bin | 101101101111010010001011… |
… | …110101111010101010100101 |
3 | 222101020211211020102212002212 |
4 | 231233102023311322222211 |
5 | 202331312104204124110 |
6 | 1551500142012213205 |
7 | 60241301605222553 |
oct | 5557221365725245 |
9 | 871224736385085 |
10 | 201161434442405 |
11 | 591070a3525198 |
12 | 1a68a52546a205 |
13 | 8832598a41b08 |
14 | 37963a029abd3 |
15 | 183ca0d18ce05 |
hex | b6f48bd7aaa5 |
201161434442405 has 8 divisors (see below), whose sum is σ = 241430191188000. Its totient is φ = 160904834315856.
The previous prime is 201161434442357. The next prime is 201161434442407. The reversal of 201161434442405 is 504244434161102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201161434442405 - 210 = 201161434441381 is a prime.
It is a super-2 number, since 2×2011614344424052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201161434442407) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3039118355 + ... + 3039184544.
It is an arithmetic number, because the mean of its divisors is an integer number (30178773898500).
Almost surely, 2201161434442405 is an apocalyptic number.
It is an amenable number.
201161434442405 is a deficient number, since it is larger than the sum of its proper divisors (40268756745595).
201161434442405 is an equidigital number, since it uses as much as digits as its factorization.
201161434442405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6078309523.
The product of its (nonzero) digits is 368640, while the sum is 41.
The spelling of 201161434442405 in words is "two hundred one trillion, one hundred sixty-one billion, four hundred thirty-four million, four hundred forty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •