Base | Representation |
---|---|
bin | 1011110110101000100100… |
… | …0011101011101110111111 |
3 | 1201010222001020000121202122 |
4 | 2331222021003223232333 |
5 | 3202014023414021343 |
6 | 43415214443313155 |
7 | 2513422410664043 |
oct | 275521103535677 |
9 | 51128036017678 |
10 | 13033230220223 |
11 | 41753a8758014 |
12 | 1565b1651b7bb |
13 | 73704a340315 |
14 | 330b51484023 |
15 | 179056b7d068 |
hex | bda890ebbbf |
13033230220223 has 4 divisors (see below), whose sum is σ = 13036176919248. Its totient is φ = 13030283521200.
The previous prime is 13033230220217. The next prime is 13033230220279. The reversal of 13033230220223 is 32202203233031.
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 13033230220223 - 238 = 12758352313279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13033230220192 and 13033230220201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13033230220823) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1473342878 + ... + 1473351723.
It is an arithmetic number, because the mean of its divisors is an integer number (3259044229812).
Almost surely, 213033230220223 is an apocalyptic number.
13033230220223 is a deficient number, since it is larger than the sum of its proper divisors (2946699025).
13033230220223 is an equidigital number, since it uses as much as digits as its factorization.
13033230220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2946699024.
The product of its (nonzero) digits is 7776, while the sum is 26.
Adding to 13033230220223 its reverse (32202203233031), we get a palindrome (45235433453254).
The spelling of 13033230220223 in words is "thirteen trillion, thirty-three billion, two hundred thirty million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •