Base | Representation |
---|---|
bin | 1011110111010001100101… |
… | …0110100110001101100000 |
3 | 1201012000110120210211000102 |
4 | 2331310121112212031200 |
5 | 3202204101201011112 |
6 | 43424235215241532 |
7 | 2514262311230150 |
oct | 275643126461540 |
9 | 51160416724012 |
10 | 13044241032032 |
11 | 417a038aaa991 |
12 | 1568089b192a8 |
13 | 7380b3581b92 |
14 | 3314b796a760 |
15 | 17949d655bc2 |
hex | bdd195a6360 |
13044241032032 has 24 divisors (see below), whose sum is σ = 29349542322576. Its totient is φ = 5590389013632.
The previous prime is 13044241032029. The next prime is 13044241032041. The reversal of 13044241032032 is 23023014244031.
13044241032032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13044241031986 and 13044241032004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29116609223 + ... + 29116609670.
It is an arithmetic number, because the mean of its divisors is an integer number (1222897596774).
Almost surely, 213044241032032 is an apocalyptic number.
It is an amenable number.
13044241032032 is an abundant number, since it is smaller than the sum of its proper divisors (16305301290544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13044241032032 is an equidigital number, since it uses as much as digits as its factorization.
13044241032032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58233218910 (or 58233218902 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 13044241032032 its reverse (23023014244031), we get a palindrome (36067255276063).
The spelling of 13044241032032 in words is "thirteen trillion, forty-four billion, two hundred forty-one million, thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •