Base | Representation |
---|---|
bin | 11101110001111000010… |
… | …01011011001100100101 |
3 | 10121211002100121122202022 |
4 | 32320330021123030211 |
5 | 113231014044220401 |
6 | 2102020133352525 |
7 | 133632062501135 |
oct | 16707411331445 |
9 | 3554070548668 |
10 | 1023211320101 |
11 | 364a3a12a273 |
12 | 14637b498745 |
13 | 75647076689 |
14 | 37749022ac5 |
15 | 1b9393b971b |
hex | ee3c25b325 |
1023211320101 has 16 divisors (see below), whose sum is σ = 1084402771200. Its totient is φ = 963751152000.
The previous prime is 1023211320091. The next prime is 1023211320107. The reversal of 1023211320101 is 1010231123201.
It is a cyclic number.
It is not a de Polignac number, because 1023211320101 - 214 = 1023211303717 is a prime.
It is a super-2 number, since 2×10232113201012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1023211320101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023211320107) 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, 17747960 + ... + 17805518.
It is an arithmetic number, because the mean of its divisors is an integer number (67775173200).
Almost surely, 21023211320101 is an apocalyptic number.
It is an amenable number.
1023211320101 is a deficient number, since it is larger than the sum of its proper divisors (61191451099).
1023211320101 is a wasteful number, since it uses less digits than its factorization.
1023211320101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72580.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1023211320101 its reverse (1010231123201), we get a palindrome (2033442443302).
The spelling of 1023211320101 in words is "one trillion, twenty-three billion, two hundred eleven million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •