Base | Representation |
---|---|
bin | 1101011101010101000… |
… | …0000000011111110001 |
3 | 211002210111022021022222 |
4 | 3113111100000133301 |
5 | 12242010004310113 |
6 | 254114502210425 |
7 | 22463424105233 |
oct | 3272520003761 |
9 | 732714267288 |
10 | 231211010033 |
11 | 8a068650a73 |
12 | 38988123a15 |
13 | 18a59561c53 |
14 | b2952c4253 |
15 | 6033560e08 |
hex | 35d54007f1 |
231211010033 has 12 divisors (see below), whose sum is σ = 245641752000. Its totient is φ = 217583733312.
The previous prime is 231211010003. The next prime is 231211010039. The reversal of 231211010033 is 330010112132.
It is not a de Polignac number, because 231211010033 - 26 = 231211009969 is a prime.
It is a super-2 number, since 2×2312110100332 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231211009993 and 231211010020.
It is not an unprimeable number, because it can be changed into a prime (231211010039) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2556260 + ... + 2645162.
It is an arithmetic number, because the mean of its divisors is an integer number (20470146000).
Almost surely, 2231211010033 is an apocalyptic number.
It is an amenable number.
231211010033 is a deficient number, since it is larger than the sum of its proper divisors (14430741967).
231211010033 is an equidigital number, since it uses as much as digits as its factorization.
231211010033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97936 (or 97919 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 231211010033 its reverse (330010112132), we get a palindrome (561221122165).
The spelling of 231211010033 in words is "two hundred thirty-one billion, two hundred eleven million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •