Base | Representation |
---|---|
bin | 1010111011000101001110… |
… | …0010001100001011011001 |
3 | 1120112011020121112000100200 |
4 | 2232301103202030023121 |
5 | 3033233221242000241 |
6 | 41313213315452413 |
7 | 2346463134605352 |
oct | 256612342141331 |
9 | 46464217460320 |
10 | 12010130031321 |
11 | 3910516332314 |
12 | 141b7882b7109 |
13 | 691720306b66 |
14 | 2d741710cd29 |
15 | 15c6274164b6 |
hex | aec5388c2d9 |
12010130031321 has 12 divisors (see below), whose sum is σ = 17444881612080. Its totient is φ = 7962022887480.
The previous prime is 12010130031301. The next prime is 12010130031413. The reversal of 12010130031321 is 12313003101021.
12010130031321 is a `hidden beast` number, since 1 + 2 + 0 + 10 + 1 + 300 + 31 + 321 = 666.
It is not a de Polignac number, because 12010130031321 - 26 = 12010130031257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12010130031294 and 12010130031303.
It is not an unprimeable number, because it can be changed into a prime (12010130031301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3727537195 + ... + 3727540416.
It is an arithmetic number, because the mean of its divisors is an integer number (1453740134340).
Almost surely, 212010130031321 is an apocalyptic number.
It is an amenable number.
12010130031321 is a deficient number, since it is larger than the sum of its proper divisors (5434751580759).
12010130031321 is a wasteful number, since it uses less digits than its factorization.
12010130031321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7455077796 (or 7455077793 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 12010130031321 its reverse (12313003101021), we get a palindrome (24323133132342).
The spelling of 12010130031321 in words is "twelve trillion, ten billion, one hundred thirty million, thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •