Base | Representation |
---|---|
bin | 1011111100010001111011… |
… | …1101011001001001000000 |
3 | 1201111020102121120021001012 |
4 | 2333010132331121021000 |
5 | 3210111210003342422 |
6 | 43531540232300052 |
7 | 2523425310130205 |
oct | 277043675311100 |
9 | 51436377507035 |
10 | 13130234434112 |
11 | 4202557040724 |
12 | 1580888b41628 |
13 | 7432392b2553 |
14 | 3357146b7cac |
15 | 17b832da74e2 |
hex | bf11ef59240 |
13130234434112 has 28 divisors (see below), whose sum is σ = 26294348500860. Its totient is φ = 6504886780416.
The previous prime is 13130234434049. The next prime is 13130234434127. The reversal of 13130234434112 is 21143443203131.
13130234434112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10759817006656 + 2370417427456 = 3280216^2 + 1539616^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
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, 941093543 + ... + 941107494.
Almost surely, 213130234434112 is an apocalyptic number.
It is an amenable number.
13130234434112 is an abundant number, since it is smaller than the sum of its proper divisors (13164114066748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130234434112 is a wasteful number, since it uses less digits than its factorization.
13130234434112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1882201158 (or 1882201148 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 13130234434112 its reverse (21143443203131), we get a palindrome (34273677637243).
The spelling of 13130234434112 in words is "thirteen trillion, one hundred thirty billion, two hundred thirty-four million, four hundred thirty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •