Base | Representation |
---|---|
bin | 101101101101110111101001… |
… | …110010100000111101001010 |
3 | 222100220112220122021200101120 |
4 | 231231313221302200331022 |
5 | 202323214013422024122 |
6 | 1551343344101500110 |
7 | 60231260652164103 |
oct | 5555675162407512 |
9 | 870815818250346 |
10 | 201064226361162 |
11 | 59079950057a6a |
12 | 1a673716711636 |
13 | 8826376790208 |
14 | 37917bbd593aa |
15 | 183a21e0e375c |
hex | b6dde9ca0f4a |
201064226361162 has 8 divisors (see below), whose sum is σ = 402128452722336. Its totient is φ = 67021408787052.
The previous prime is 201064226361139. The next prime is 201064226361169. The reversal of 201064226361162 is 261163622460102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
201064226361162 is an admirable number.
It is a super-2 number, since 2×2010642263611622 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201064226361169) 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, 16755352196758 + ... + 16755352196769.
It is an arithmetic number, because the mean of its divisors is an integer number (50266056590292).
Almost surely, 2201064226361162 is an apocalyptic number.
201064226361162 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201064226361162 is a wasteful number, since it uses less digits than its factorization.
201064226361162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33510704393532.
The product of its (nonzero) digits is 248832, while the sum is 42.
The spelling of 201064226361162 in words is "two hundred one trillion, sixty-four billion, two hundred twenty-six million, three hundred sixty-one thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •