Base | Representation |
---|---|
bin | 1011110100101101111001… |
… | …0101000100000010100111 |
3 | 1201000211001100002001111122 |
4 | 2331023132111010002213 |
5 | 3200444104040214343 |
6 | 43352131134124155 |
7 | 2511145403045462 |
oct | 275133625040247 |
9 | 51024040061448 |
10 | 13000301101223 |
11 | 4162440066587 |
12 | 155b66665065b |
13 | 733c00180517 |
14 | 32d30a0042d9 |
15 | 17827ad12068 |
hex | bd2de5440a7 |
13000301101223 has 8 divisors (see below), whose sum is σ = 13006438237968. Its totient is φ = 12994164336384.
The previous prime is 13000301101217. The next prime is 13000301101283. The reversal of 13000301101223 is 32210110300031.
13000301101223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13000301101223 - 220 = 13000300052647 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000301101283) 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, 90241136 + ... + 90385082.
It is an arithmetic number, because the mean of its divisors is an integer number (1625804779746).
Almost surely, 213000301101223 is an apocalyptic number.
13000301101223 is a deficient number, since it is larger than the sum of its proper divisors (6137136745).
13000301101223 is a wasteful number, since it uses less digits than its factorization.
13000301101223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185953.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13000301101223 its reverse (32210110300031), we get a palindrome (45210411401254).
The spelling of 13000301101223 in words is "thirteen trillion, three hundred one million, one hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •