Base | Representation |
---|---|
bin | 1011110110011101010101… |
… | …0010101000101011110101 |
3 | 1201010200021000221000001221 |
4 | 2331213111102220223311 |
5 | 3201441334321203023 |
6 | 43413555304350341 |
7 | 2513254566406534 |
oct | 275472522505365 |
9 | 51120230830057 |
10 | 13030214241013 |
11 | 41740a0273212 |
12 | 15654144753b1 |
13 | 736989552838 |
14 | 330946abc31b |
15 | 178e2bece85d |
hex | bd9d54a8af5 |
13030214241013 has 4 divisors (see below), whose sum is σ = 13716014990560. Its totient is φ = 12344413491468.
The previous prime is 13030214240977. The next prime is 13030214241041. The reversal of 13030214241013 is 31014241203031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13030214241013 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 (13030214241043) 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, 342900374745 + ... + 342900374782.
It is an arithmetic number, because the mean of its divisors is an integer number (3429003747640).
Almost surely, 213030214241013 is an apocalyptic number.
It is an amenable number.
13030214241013 is a deficient number, since it is larger than the sum of its proper divisors (685800749547).
13030214241013 is an equidigital number, since it uses as much as digits as its factorization.
13030214241013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685800749546.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13030214241013 its reverse (31014241203031), we get a palindrome (44044455444044).
The spelling of 13030214241013 in words is "thirteen trillion, thirty billion, two hundred fourteen million, two hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •