Base | Representation |
---|---|
bin | 1100000000011110011101… |
… | …0000101110011100000111 |
3 | 1201202010110222210000221002 |
4 | 3000013213100232130013 |
5 | 3212301314443001043 |
6 | 44025020504443515 |
7 | 2531556441664436 |
oct | 300074720563407 |
9 | 51663428700832 |
10 | 13202314422023 |
11 | 4230085342471 |
12 | 159284447959b |
13 | 749c8562bc7c |
14 | 338dd164b11d |
15 | 17d650dcabb8 |
hex | c01e742e707 |
13202314422023 has 8 divisors (see below), whose sum is σ = 13390615641648. Its totient is φ = 13014709326144.
The previous prime is 13202314422007. The next prime is 13202314422043. The reversal of 13202314422023 is 32022441320231.
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 13202314422023 - 24 = 13202314422007 is a prime.
It is a super-2 number, since 2×132023144220232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202314422043) 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, 173992736 + ... + 174068597.
It is an arithmetic number, because the mean of its divisors is an integer number (1673826955206).
Almost surely, 213202314422023 is an apocalyptic number.
13202314422023 is a deficient number, since it is larger than the sum of its proper divisors (188301219625).
13202314422023 is an equidigital number, since it uses as much as digits as its factorization.
13202314422023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 348061873.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 13202314422023 its reverse (32022441320231), we get a palindrome (45224755742254).
The spelling of 13202314422023 in words is "thirteen trillion, two hundred two billion, three hundred fourteen million, four hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •