Base | Representation |
---|---|
bin | 1011000111011110010110… |
… | …0011110000011011110101 |
3 | 1121021111210012121022202000 |
4 | 2301313211203300123311 |
5 | 3100230233012004023 |
6 | 41555103424005513 |
7 | 2401041105623415 |
oct | 261674543603365 |
9 | 47244705538660 |
10 | 12223033313013 |
11 | 3992839718a86 |
12 | 1454aa5160899 |
13 | 6a881c962b53 |
14 | 303852b80645 |
15 | 162e38585243 |
hex | b1de58f06f5 |
12223033313013 has 48 divisors (see below), whose sum is σ = 19298705616960. Its totient is φ = 7644371127552.
The previous prime is 12223033313003. The next prime is 12223033313039. The reversal of 12223033313013 is 31031333032221.
12223033313013 is a `hidden beast` number, since 1 + 2 + 2 + 23 + 0 + 3 + 331 + 301 + 3 = 666.
It is not a de Polignac number, because 12223033313013 - 26 = 12223033312949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12223033313003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 155706 + ... + 4946747.
It is an arithmetic number, because the mean of its divisors is an integer number (402056367020).
Almost surely, 212223033313013 is an apocalyptic number.
It is an amenable number.
12223033313013 is a deficient number, since it is larger than the sum of its proper divisors (7075672303947).
12223033313013 is a wasteful number, since it uses less digits than its factorization.
12223033313013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5102803 (or 5102780 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 12223033313013 its reverse (31031333032221), we get a palindrome (43254366345234).
The spelling of 12223033313013 in words is "twelve trillion, two hundred twenty-three billion, thirty-three million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •