Base | Representation |
---|---|
bin | 1011111100010010000000… |
… | …1001111111011111010101 |
3 | 1201111020111000100102122200 |
4 | 2333010200021333133111 |
5 | 3210111230123423013 |
6 | 43531542230515113 |
7 | 2523425642611431 |
oct | 277044011773725 |
9 | 51436430312580 |
10 | 13130254514133 |
11 | 4202567406089 |
12 | 1580893805a99 |
13 | 7432404c3213 |
14 | 3357172239c1 |
15 | 17b834a21e73 |
hex | bf12027f7d5 |
13130254514133 has 24 divisors (see below), whose sum is σ = 19223522847360. Its totient is φ = 8635067263680.
The previous prime is 13130254514119. The next prime is 13130254514207. The reversal of 13130254514133 is 33141545203131.
13130254514133 is a `hidden beast` number, since 1 + 3 + 1 + 3 + 0 + 2 + 5 + 4 + 514 + 133 = 666.
It is a de Polignac number, because none of the positive numbers 2k-13130254514133 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13130254514233) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18671391 + ... + 19361852.
It is an arithmetic number, because the mean of its divisors is an integer number (800980118640).
Almost surely, 213130254514133 is an apocalyptic number.
It is an amenable number.
13130254514133 is a deficient number, since it is larger than the sum of its proper divisors (6093268333227).
13130254514133 is a wasteful number, since it uses less digits than its factorization.
13130254514133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38033769 (or 38033766 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 13130254514133 its reverse (33141545203131), we get a palindrome (46271799717264).
The spelling of 13130254514133 in words is "thirteen trillion, one hundred thirty billion, two hundred fifty-four million, five hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •