Base | Representation |
---|---|
bin | 1011000010000100001110… |
… | …0000011100000101001001 |
3 | 1120221121221221020012121221 |
4 | 2300201003200130011021 |
5 | 3042214441234033001 |
6 | 41444300022002041 |
7 | 2361241454441266 |
oct | 260410340340511 |
9 | 46847857205557 |
10 | 12130120221001 |
11 | 395739a6a6832 |
12 | 143aa94876321 |
13 | 69cb33467ab3 |
14 | 2dd15b02026d |
15 | 1607eb5d01a1 |
hex | b084381c149 |
12130120221001 has 4 divisors (see below), whose sum is σ = 12131322066052. Its totient is φ = 12128918375952.
The previous prime is 12130120220957. The next prime is 12130120221061. The reversal of 12130120221001 is 10012202103121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8831624958025 + 3298495262976 = 2971805^2 + 1816176^2 .
It is a cyclic number.
It is not a de Polignac number, because 12130120221001 - 219 = 12130119696713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12130120221061) 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, 600907386 + ... + 600927571.
It is an arithmetic number, because the mean of its divisors is an integer number (3032830516513).
Almost surely, 212130120221001 is an apocalyptic number.
It is an amenable number.
12130120221001 is a deficient number, since it is larger than the sum of its proper divisors (1201845051).
12130120221001 is a wasteful number, since it uses less digits than its factorization.
12130120221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201845050.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12130120221001 its reverse (10012202103121), we get a palindrome (22142322324122).
The spelling of 12130120221001 in words is "twelve trillion, one hundred thirty billion, one hundred twenty million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •