Base | Representation |
---|---|
bin | 1011110111000101100001… |
… | …0011111110001101100111 |
3 | 1201011201002212122021102222 |
4 | 2331301120103332031213 |
5 | 3202130433044404343 |
6 | 43422542003022555 |
7 | 2514116123633663 |
oct | 275613023761547 |
9 | 51151085567388 |
10 | 13041002341223 |
11 | 417872693060a |
12 | 156752536aa5b |
13 | 7379b85b769c |
14 | 33128b78d8a3 |
15 | 17935e163a68 |
hex | bdc584fe367 |
13041002341223 has 8 divisors (see below), whose sum is σ = 13250660153760. Its totient is φ = 12832066243360.
The previous prime is 13041002341219. The next prime is 13041002341253. The reversal of 13041002341223 is 32214320014031.
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 13041002341223 - 22 = 13041002341219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13041002341192 and 13041002341201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13041002341253) 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, 180392240 + ... + 180464517.
It is an arithmetic number, because the mean of its divisors is an integer number (1656332519220).
Almost surely, 213041002341223 is an apocalyptic number.
13041002341223 is a deficient number, since it is larger than the sum of its proper divisors (209657812537).
13041002341223 is an equidigital number, since it uses as much as digits as its factorization.
13041002341223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 360857337.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 13041002341223 its reverse (32214320014031), we get a palindrome (45255322355254).
The spelling of 13041002341223 in words is "thirteen trillion, forty-one billion, two million, three hundred forty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •