Base | Representation |
---|---|
bin | 101101101101001000111000… |
… | …110111000000011011000110 |
3 | 222100201202022012121110111222 |
4 | 231231020320313000123012 |
5 | 202321403144403044032 |
6 | 1551304321330200342 |
7 | 60224532432364424 |
oct | 5555107067003306 |
9 | 870652265543458 |
10 | 201014013331142 |
11 | 5905a623112350 |
12 | 1a665a424230b2 |
13 | 882170385342b |
14 | 378d1b7214114 |
15 | 1838c80bbda12 |
hex | b6d238dc06c6 |
201014013331142 has 48 divisors (see below), whose sum is σ = 339935028166800. Its totient is φ = 88409574907200.
The previous prime is 201014013331141. The next prime is 201014013331169. The reversal of 201014013331142 is 241133310410102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201014013331141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 143682584 + ... + 145074852.
It is an arithmetic number, because the mean of its divisors is an integer number (7081979753475).
Almost surely, 2201014013331142 is an apocalyptic number.
201014013331142 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201014013331142 is a deficient number, since it is larger than the sum of its proper divisors (138921014835658).
201014013331142 is a wasteful number, since it uses less digits than its factorization.
201014013331142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1399173 (or 1399142 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 201014013331142 its reverse (241133310410102), we get a palindrome (442147323741244).
The spelling of 201014013331142 in words is "two hundred one trillion, fourteen billion, thirteen million, three hundred thirty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •