Base | Representation |
---|---|
bin | 1011000111111000110010… |
… | …0011111101110001010001 |
3 | 1121022012002210111222110122 |
4 | 2301332030203331301101 |
5 | 3100334301303130001 |
6 | 42002235541240025 |
7 | 2401412011600100 |
oct | 261761443756121 |
9 | 47265083458418 |
10 | 12230130130001 |
11 | 399585068a693 |
12 | 1456345a03015 |
13 | 6a93b1036844 |
14 | 303d27500037 |
15 | 163201625b1b |
hex | b1f8c8fdc51 |
12230130130001 has 6 divisors (see below), whose sum is σ = 14226886069650. Its totient is φ = 10482968682816.
The previous prime is 12230130129991. The next prime is 12230130130013. The reversal of 12230130130001 is 10003103103221.
It can be written as a sum of positive squares in only one way, i.e., 12048368597776 + 181761532225 = 3471076^2 + 426335^2 .
It is not a de Polignac number, because 12230130130001 - 230 = 12229056388177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12230130130061) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 124797246176 + ... + 124797246273.
It is an arithmetic number, because the mean of its divisors is an integer number (2371147678275).
Almost surely, 212230130130001 is an apocalyptic number.
It is an amenable number.
12230130130001 is a deficient number, since it is larger than the sum of its proper divisors (1996755939649).
12230130130001 is an equidigital number, since it uses as much as digits as its factorization.
12230130130001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249594492463 (or 249594492456 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 12230130130001 its reverse (10003103103221), we get a palindrome (22233233233222).
The spelling of 12230130130001 in words is "twelve trillion, two hundred thirty billion, one hundred thirty million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •