Base | Representation |
---|---|
bin | 1011110110100100000011… |
… | …1111101101101111001101 |
3 | 1201010211220222002001122202 |
4 | 2331221000333231233031 |
5 | 3202004034413022201 |
6 | 43414454454251245 |
7 | 2513350430442656 |
oct | 275510077555715 |
9 | 51124828061582 |
10 | 13032021220301 |
11 | 4174938264526 |
12 | 1565839656b25 |
13 | 736bb6a17555 |
14 | 330a78a9052d |
15 | 178ed5965c6b |
hex | bda40fedbcd |
13032021220301 has 6 divisors (see below), whose sum is σ = 13159774101870. Its totient is φ = 12905496731928.
The previous prime is 13032021220261. The next prime is 13032021220397. The reversal of 13032021220301 is 10302212023031.
It can be written as a sum of positive squares in only one way, i.e., 11935822690276 + 1096198530025 = 3454826^2 + 1046995^2 .
It is not a de Polignac number, because 13032021220301 - 226 = 13031954111437 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 (13032021228301) 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, 614185886 + ... + 614207103.
It is an arithmetic number, because the mean of its divisors is an integer number (2193295683645).
Almost surely, 213032021220301 is an apocalyptic number.
It is an amenable number.
13032021220301 is a deficient number, since it is larger than the sum of its proper divisors (127752881569).
13032021220301 is an equidigital number, since it uses as much as digits as its factorization.
13032021220301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228393195 (or 1228393092 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13032021220301 its reverse (10302212023031), we get a palindrome (23334233243332).
The spelling of 13032021220301 in words is "thirteen trillion, thirty-two billion, twenty-one million, two hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •