Base | Representation |
---|---|
bin | 1010111010101011000101… |
… | …0010110110001111011110 |
3 | 1120111111010120222122110111 |
4 | 2232222301102312033132 |
5 | 3033124333430224042 |
6 | 41310053135200234 |
7 | 2346124222136044 |
oct | 256526122661736 |
9 | 46444116878414 |
10 | 12003113133022 |
11 | 3908545496810 |
12 | 141a34a37607a |
13 | 690b7266552b |
14 | 2d6d4d234394 |
15 | 15c3663b0517 |
hex | aeab14b63de |
12003113133022 has 8 divisors (see below), whose sum is σ = 19641457854072. Its totient is φ = 5455960515000.
The previous prime is 12003113132999. The next prime is 12003113133043. The reversal of 12003113133022 is 22033131130021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 545596051501 = 12003113133022 / (1 + 2 + 0 + 0 + 3 + 1 + 1 + 3 + 1 + 3 + 3 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 12003113132984 and 12003113133002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 272798025729 + ... + 272798025772.
It is an arithmetic number, because the mean of its divisors is an integer number (2455182231759).
Almost surely, 212003113133022 is an apocalyptic number.
12003113133022 is a deficient number, since it is larger than the sum of its proper divisors (7638344721050).
12003113133022 is a wasteful number, since it uses less digits than its factorization.
12003113133022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545596051514.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12003113133022 its reverse (22033131130021), we get a palindrome (34036244263043).
The spelling of 12003113133022 in words is "twelve trillion, three billion, one hundred thirteen million, one hundred thirty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •