Base | Representation |
---|---|
bin | 1011111000010100101110… |
… | …1100111111100100000111 |
3 | 1201020201222202021102021012 |
4 | 2332011023230333210013 |
5 | 3203003010000224111 |
6 | 43440415541112435 |
7 | 2515501055633246 |
oct | 276051354774407 |
9 | 51221882242235 |
10 | 13062265633031 |
11 | 418674846544a |
12 | 156b67a3b871b |
13 | 7399c6916b64 |
14 | 33230775c95d |
15 | 179ba5c6d48b |
hex | be14bb3f907 |
13062265633031 has 4 divisors (see below), whose sum is σ = 13062285613200. Its totient is φ = 13062245652864.
The previous prime is 13062265633019. The next prime is 13062265633037. The reversal of 13062265633031 is 13033656226031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13062265633031 - 218 = 13062265370887 is a prime.
It is a super-2 number, since 2×130622656330312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13062265633031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13062265633037) 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, 8975066 + ... + 10328423.
It is an arithmetic number, because the mean of its divisors is an integer number (3265571403300).
Almost surely, 213062265633031 is an apocalyptic number.
13062265633031 is a deficient number, since it is larger than the sum of its proper divisors (19980169).
13062265633031 is an equidigital number, since it uses as much as digits as its factorization.
13062265633031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19980168.
The product of its (nonzero) digits is 349920, while the sum is 41.
The spelling of 13062265633031 in words is "thirteen trillion, sixty-two billion, two hundred sixty-five million, six hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •