Base | Representation |
---|---|
bin | 101111110001100000011110… |
… | …011100111001011100100101 |
3 | 1000112221100102211111100012202 |
4 | 233301200132130321130211 |
5 | 210014421404104342013 |
6 | 2022511202214224245 |
7 | 62153653243055360 |
oct | 5761403634713445 |
9 | 1015840384440182 |
10 | 210110311012133 |
11 | 60a473120024a4 |
12 | 1b694952055085 |
13 | 903141819953c |
14 | 39c55713750d7 |
15 | 19456b8561858 |
hex | bf181e739725 |
210110311012133 has 16 divisors (see below), whose sum is σ = 253738059386880. Its totient is φ = 170083792912176.
The previous prime is 210110311012111. The next prime is 210110311012219. The reversal of 210110311012133 is 331210113011012.
It is a cyclic number.
It is not a de Polignac number, because 210110311012133 - 214 = 210110310995749 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210110311212133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8259689735 + ... + 8259715172.
It is an arithmetic number, because the mean of its divisors is an integer number (15858628711680).
Almost surely, 2210110311012133 is an apocalyptic number.
210110311012133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
210110311012133 is a deficient number, since it is larger than the sum of its proper divisors (43627748374747).
210110311012133 is a wasteful number, since it uses less digits than its factorization.
210110311012133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16519405016.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 210110311012133 its reverse (331210113011012), we get a palindrome (541320424023145).
The spelling of 210110311012133 in words is "two hundred ten trillion, one hundred ten billion, three hundred eleven million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •