Base | Representation |
---|---|
bin | 1011110110011100100101… |
… | …0011000010101100010101 |
3 | 1201010122202000021222000222 |
4 | 2331213021103002230111 |
5 | 3201440431313132244 |
6 | 43413523315444125 |
7 | 2513246604151241 |
oct | 275471123025425 |
9 | 51118660258028 |
10 | 13030013020949 |
11 | 4173aa7727641 |
12 | 1565378bb6645 |
13 | 73695695c102 |
14 | 33092809d421 |
15 | 178e194d3bee |
hex | bd9c94c2b15 |
13030013020949 has 2 divisors, whose sum is σ = 13030013020950. Its totient is φ = 13030013020948.
The previous prime is 13030013020931. The next prime is 13030013020979. The reversal of 13030013020949 is 94902031003031.
13030013020949 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11789217532849 + 1240795488100 = 3433543^2 + 1113910^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13030013020949 is a prime.
It is a super-2 number, since 2×130300130209492 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13030013020979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515006510474 + 6515006510475.
It is an arithmetic number, because the mean of its divisors is an integer number (6515006510475).
Almost surely, 213030013020949 is an apocalyptic number.
It is an amenable number.
13030013020949 is a deficient number, since it is larger than the sum of its proper divisors (1).
13030013020949 is an equidigital number, since it uses as much as digits as its factorization.
13030013020949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 13030013020949 in words is "thirteen trillion, thirty billion, thirteen million, twenty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •