Base | Representation |
---|---|
bin | 10111010001001001010100… |
… | …101101100011101010101101 |
3 | 111102022222011110112112002102 |
4 | 113101021110231203222231 |
5 | 101403112110334220323 |
6 | 1001351135145104445 |
7 | 30361223604121115 |
oct | 2721112455435255 |
9 | 442288143475072 |
10 | 102333312023213 |
11 | 2a67434a8a4357 |
12 | b588a6b188125 |
13 | 4513cb3b02a4b |
14 | 1b3ad5ca78045 |
15 | bc6dce710328 |
hex | 5d1254b63aad |
102333312023213 has 8 divisors (see below), whose sum is σ = 103140843666432. Its totient is φ = 101525807841696.
The previous prime is 102333312023207. The next prime is 102333312023249. The reversal of 102333312023213 is 312320213333201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102333312023213 - 210 = 102333312022189 is a prime.
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 (102333312023263) 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, 649106 + ... + 14320892.
It is an arithmetic number, because the mean of its divisors is an integer number (12892605458304).
Almost surely, 2102333312023213 is an apocalyptic number.
It is an amenable number.
102333312023213 is a deficient number, since it is larger than the sum of its proper divisors (807531643219).
102333312023213 is a wasteful number, since it uses less digits than its factorization.
102333312023213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13730851.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 102333312023213 its reverse (312320213333201), we get a palindrome (414653525356414).
The spelling of 102333312023213 in words is "one hundred two trillion, three hundred thirty-three billion, three hundred twelve million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •