Base | Representation |
---|---|
bin | 1011110110100011111111… |
… | …0111001010111001010111 |
3 | 1201010211212122021220010112 |
4 | 2331220333313022321113 |
5 | 3202004020031000343 |
6 | 43414452534513235 |
7 | 2513350110006413 |
oct | 275507767127127 |
9 | 51124778256115 |
10 | 13032002203223 |
11 | 4174928555733 |
12 | 156583320581b |
13 | 736bb2ab9643 |
14 | 330a7633dd43 |
15 | 178ed3e5b218 |
hex | bda3fdcae57 |
13032002203223 has 4 divisors (see below), whose sum is σ = 13057605351480. Its totient is φ = 13006399054968.
The previous prime is 13032002203153. The next prime is 13032002203243. The reversal of 13032002203223 is 32230220023031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13032002203223 - 234 = 13014822334039 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 (13032002203243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12801573365 + ... + 12801574382.
It is an arithmetic number, because the mean of its divisors is an integer number (3264401337870).
Almost surely, 213032002203223 is an apocalyptic number.
13032002203223 is a deficient number, since it is larger than the sum of its proper divisors (25603148257).
13032002203223 is an equidigital number, since it uses as much as digits as its factorization.
13032002203223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25603148256.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 13032002203223 its reverse (32230220023031), we get a palindrome (45262222226254).
The spelling of 13032002203223 in words is "thirteen trillion, thirty-two billion, two million, two hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •