Base | Representation |
---|---|
bin | 1011111011110000101100… |
… | …0010100100001110000000 |
3 | 1201110101101200020211221221 |
4 | 2332330023002210032000 |
5 | 3204434420414430141 |
6 | 43523502521324424 |
7 | 2522661205261345 |
oct | 276741302441600 |
9 | 51411350224857 |
10 | 13121310311296 |
11 | 41a9797665110 |
12 | 157abb8336714 |
13 | 74244647abc5 |
14 | 3351093b47cc |
15 | 17b4ae6b7bd1 |
hex | bef0b0a4380 |
13121310311296 has 32 divisors (see below), whose sum is σ = 28516484060280. Its totient is φ = 5964231959040.
The previous prime is 13121310311227. The next prime is 13121310311297. The reversal of 13121310311296 is 69211301312131.
It is a tau number, because it is divible by the number of its divisors (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13121310311297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4659554811 + ... + 4659557626.
Almost surely, 213121310311296 is an apocalyptic number.
13121310311296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
13121310311296 is an abundant number, since it is smaller than the sum of its proper divisors (15395173748984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13121310311296 is an equidigital number, since it uses as much as digits as its factorization.
13121310311296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9319112462 (or 9319112450 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 34.
The spelling of 13121310311296 in words is "thirteen trillion, one hundred twenty-one billion, three hundred ten million, three hundred eleven thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •