Base | Representation |
---|---|
bin | 1011000011001110101100… |
… | …0000101010100011000001 |
3 | 1121000112120002011010020220 |
4 | 2300303223000222203001 |
5 | 3043031411221124441 |
6 | 41501403355253253 |
7 | 2362550026543455 |
oct | 260635300524301 |
9 | 47015502133226 |
10 | 12150110333121 |
11 | 3964918591952 |
12 | 144293344a229 |
13 | 6a199aa8cbc7 |
14 | 3000d5c90665 |
15 | 1610bb546466 |
hex | b0ceb02a8c1 |
12150110333121 has 16 divisors (see below), whose sum is σ = 16653363672960. Its totient is φ = 7876590906240.
The previous prime is 12150110333077. The next prime is 12150110333131. The reversal of 12150110333121 is 12133301105121.
It is not a de Polignac number, because 12150110333121 - 217 = 12150110202049 is a prime.
It is a super-2 number, since 2×121501103331212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12150110333091 and 12150110333100.
It is not an unprimeable number, because it can be changed into a prime (12150110333131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 390688366 + ... + 390719463.
It is an arithmetic number, because the mean of its divisors is an integer number (1040835229560).
Almost surely, 212150110333121 is an apocalyptic number.
It is an amenable number.
12150110333121 is a deficient number, since it is larger than the sum of its proper divisors (4503253339839).
12150110333121 is an equidigital number, since it uses as much as digits as its factorization.
12150110333121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 781407976.
The product of its (nonzero) digits is 540, while the sum is 24.
Adding to 12150110333121 its reverse (12133301105121), we get a palindrome (24283411438242).
The spelling of 12150110333121 in words is "twelve trillion, one hundred fifty billion, one hundred ten million, three hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •