Base | Representation |
---|---|
bin | 1011111100011001011000… |
… | …0001111101101100101101 |
3 | 1201111102120211120021110101 |
4 | 2333012112001331230231 |
5 | 3210124302410334013 |
6 | 43532510353511101 |
7 | 2523525645156466 |
oct | 277062601755455 |
9 | 51442524507411 |
10 | 13132232121133 |
11 | 4203391748534 |
12 | 1581145b72491 |
13 | 743497129b88 |
14 | 335863b2dd6d |
15 | 17b8ed45e8dd |
hex | bf19607db2d |
13132232121133 has 4 divisors (see below), whose sum is σ = 13254963262560. Its totient is φ = 13009500979708.
The previous prime is 13132232121119. The next prime is 13132232121181. The reversal of 13132232121133 is 33112123223131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13132232121133 - 221 = 13132230023981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13132232122133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61365570553 + ... + 61365570766.
It is an arithmetic number, because the mean of its divisors is an integer number (3313740815640).
Almost surely, 213132232121133 is an apocalyptic number.
It is an amenable number.
13132232121133 is a deficient number, since it is larger than the sum of its proper divisors (122731141427).
13132232121133 is a wasteful number, since it uses less digits than its factorization.
13132232121133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122731141426.
The product of its digits is 3888, while the sum is 28.
Adding to 13132232121133 its reverse (33112123223131), we get a palindrome (46244355344264).
The spelling of 13132232121133 in words is "thirteen trillion, one hundred thirty-two billion, two hundred thirty-two million, one hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •