Base | Representation |
---|---|
bin | 11101110001111000001… |
… | …00100000110000000101 |
3 | 10121211002021012012222210 |
4 | 32320330010200300011 |
5 | 113231013232012013 |
6 | 2102020050014033 |
7 | 133632045525132 |
oct | 16707404406005 |
9 | 3554067165883 |
10 | 1023210032133 |
11 | 364a3942a633 |
12 | 14637ab77319 |
13 | 75646a15373 |
14 | 37748ba9589 |
15 | 1b939212cc3 |
hex | ee3c120c05 |
1023210032133 has 8 divisors (see below), whose sum is σ = 1386645289696. Its totient is φ = 670957398000.
The previous prime is 1023210032101. The next prime is 1023210032171. The reversal of 1023210032133 is 3312300123201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023210032133 - 25 = 1023210032101 is a prime.
It is a super-2 number, since 2×10232100321332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023210033133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2795655643 + ... + 2795656008.
It is an arithmetic number, because the mean of its divisors is an integer number (173330661212).
Almost surely, 21023210032133 is an apocalyptic number.
It is an amenable number.
1023210032133 is a deficient number, since it is larger than the sum of its proper divisors (363435257563).
1023210032133 is an equidigital number, since it uses as much as digits as its factorization.
1023210032133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5591311715.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1023210032133 its reverse (3312300123201), we get a palindrome (4335510155334).
The spelling of 1023210032133 in words is "one trillion, twenty-three billion, two hundred ten million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •