Base | Representation |
---|---|
bin | 101101101110100100001010… |
… | …000110001100111010100011 |
3 | 222101002010020222100010201212 |
4 | 231232210022012030322203 |
5 | 202330004400314024443 |
6 | 1551421330000020335 |
7 | 60234602110200323 |
oct | 5556441206147243 |
9 | 871063228303655 |
10 | 201112013033123 |
11 | 59098142417995 |
12 | 1a680a323016ab |
13 | 882aa20b12c7a |
14 | 3793c3273d283 |
15 | 183b5b94d7618 |
hex | b6e90a18cea3 |
201112013033123 has 8 divisors (see below), whose sum is σ = 211697109781200. Its totient is φ = 190526941680768.
The previous prime is 201112013033117. The next prime is 201112013033201. The reversal of 201112013033123 is 321330310211102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201112013033123 - 228 = 201111744597667 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201112013033623) 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 7 ways as a sum of consecutive naturals, for example, 11141663 + ... + 22942551.
It is an arithmetic number, because the mean of its divisors is an integer number (26462138722650).
Almost surely, 2201112013033123 is an apocalyptic number.
201112013033123 is a deficient number, since it is larger than the sum of its proper divisors (10585096748077).
201112013033123 is a wasteful number, since it uses less digits than its factorization.
201112013033123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12697861.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 201112013033123 its reverse (321330310211102), we get a palindrome (522442323244225).
The spelling of 201112013033123 in words is "two hundred one trillion, one hundred twelve billion, thirteen million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •