Base | Representation |
---|---|
bin | 1011111100010001011110… |
… | …1010011010111000110101 |
3 | 1201111020010002012222110222 |
4 | 2333010113222122320311 |
5 | 3210110432134120041 |
6 | 43531520140424125 |
7 | 2523422262462623 |
oct | 277042752327065 |
9 | 51436102188428 |
10 | 13130112020021 |
11 | 42024a3a30157 |
12 | 1580853b48045 |
13 | 743219b21889 |
14 | 335702330513 |
15 | 17b82727674b |
hex | bf117a9ae35 |
13130112020021 has 8 divisors (see below), whose sum is σ = 13949979220920. Its totient is φ = 12334718467008.
The previous prime is 13130112019993. The next prime is 13130112020041. The reversal of 13130112020021 is 12002021103131.
It can be written as a sum of positive squares in 4 ways, for example, as 3943060089796 + 9187051930225 = 1985714^2 + 3031015^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13130112020021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13130112020041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6118410866 + ... + 6118413011.
It is an arithmetic number, because the mean of its divisors is an integer number (1743747402615).
Almost surely, 213130112020021 is an apocalyptic number.
It is an amenable number.
13130112020021 is a deficient number, since it is larger than the sum of its proper divisors (819867200899).
13130112020021 is a wasteful number, since it uses less digits than its factorization.
13130112020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12236823943.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13130112020021 its reverse (12002021103131), we get a palindrome (25132133123152).
The spelling of 13130112020021 in words is "thirteen trillion, one hundred thirty billion, one hundred twelve million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •