Base | Representation |
---|---|
bin | 1100000001000111011111… |
… | …1110001101111000111111 |
3 | 1201210011220211200012100222 |
4 | 3000101313332031320333 |
5 | 3212441401020413043 |
6 | 44034042050011555 |
7 | 2532426455366213 |
oct | 300216776157077 |
9 | 51704824605328 |
10 | 13213332201023 |
11 | 4234819613949 |
12 | 15949ba276bbb |
13 | 74b02013cb26 |
14 | 339758a28943 |
15 | 17da982ccd68 |
hex | c0477f8de3f |
13213332201023 has 8 divisors (see below), whose sum is σ = 13328846931456. Its totient is φ = 13098316455000.
The previous prime is 13213332201019. The next prime is 13213332201077. The reversal of 13213332201023 is 32010223331231.
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 13213332201023 - 22 = 13213332201019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13213332200983 and 13213332201001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13213332291023) 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, 124692911 + ... + 124798832.
It is an arithmetic number, because the mean of its divisors is an integer number (1666105866432).
Almost surely, 213213332201023 is an apocalyptic number.
13213332201023 is a deficient number, since it is larger than the sum of its proper divisors (115514730433).
13213332201023 is a wasteful number, since it uses less digits than its factorization.
13213332201023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249492205.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 13213332201023 its reverse (32010223331231), we get a palindrome (45223555532254).
The spelling of 13213332201023 in words is "thirteen trillion, two hundred thirteen billion, three hundred thirty-two million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •