Base | Representation |
---|---|
bin | 1100000010001101011101… |
… | …0110101001111011001100 |
3 | 1201211222101122202200111020 |
4 | 3000203113112221323030 |
5 | 3213243331222441022 |
6 | 44050425400554140 |
7 | 2533663035610326 |
oct | 300432726517314 |
9 | 51758348680436 |
10 | 13232112312012 |
11 | 4241786492230 |
12 | 159857b782950 |
13 | 74ca23b7b539 |
14 | 33a61acc4616 |
15 | 17e2e6dd035c |
hex | c08d75a9ecc |
13232112312012 has 48 divisors (see below), whose sum is σ = 33858084685824. Its totient is φ = 3988737640000.
The previous prime is 13232112312007. The next prime is 13232112312049. The reversal of 13232112312012 is 21021321123231.
13232112312012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 262391739 + ... + 262442162.
It is an arithmetic number, because the mean of its divisors is an integer number (705376764288).
Almost surely, 213232112312012 is an apocalyptic number.
13232112312012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13232112312012 is an abundant number, since it is smaller than the sum of its proper divisors (20625972373812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13232112312012 is a wasteful number, since it uses less digits than its factorization.
13232112312012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524834110 (or 524834108 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13232112312012 its reverse (21021321123231), we get a palindrome (34253433435243).
The spelling of 13232112312012 in words is "thirteen trillion, two hundred thirty-two billion, one hundred twelve million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •