Base | Representation |
---|---|
bin | 1100000000111100100111… |
… | …1000010000000000001111 |
3 | 1201202220101021200012021220 |
4 | 3000033021320100000033 |
5 | 3212414410304314411 |
6 | 44032440151054423 |
7 | 2532264211116012 |
oct | 300171170200017 |
9 | 51686337605256 |
10 | 13210411401231 |
11 | 423355a928820 |
12 | 1594324071413 |
13 | 74a975c98925 |
14 | 33955cb5b379 |
15 | 17d976b80b06 |
hex | c03c9e1000f |
13210411401231 has 32 divisors (see below), whose sum is σ = 20105219063808. Its totient is φ = 7637342291040.
The previous prime is 13210411401221. The next prime is 13210411401269.
13210411401231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13210411401231 - 223 = 13210403012623 is a prime.
It is a super-2 number, since 2×132104114012312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210411401221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23434011 + ... + 23991116.
It is an arithmetic number, because the mean of its divisors is an integer number (628288095744).
Almost surely, 213210411401231 is an apocalyptic number.
13210411401231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13210411401231 is a deficient number, since it is larger than the sum of its proper divisors (6894807662577).
13210411401231 is a wasteful number, since it uses less digits than its factorization.
13210411401231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47425531.
The product of its (nonzero) digits is 576, while the sum is 24.
It can be divided in two parts, 1321041 and 1401231, that added together give a palindrome (2722272).
The spelling of 13210411401231 in words is "thirteen trillion, two hundred ten billion, four hundred eleven million, four hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •