Base | Representation |
---|---|
bin | 11000011101011110… |
… | …00100101101111001 |
3 | 1020220012101222010222 |
4 | 30032233010231321 |
5 | 203343310414001 |
6 | 10011030545425 |
7 | 643266126614 |
oct | 141657045571 |
9 | 36805358128 |
10 | 13132123001 |
11 | 5629817418 |
12 | 2665b08275 |
13 | 13138818aa |
14 | 8c811d17b |
15 | 51cd4e61b |
hex | 30ebc4b79 |
13132123001 has 4 divisors (see below), whose sum is σ = 13555739904. Its totient is φ = 12708506100.
The previous prime is 13132122953. The next prime is 13132123007. The reversal of 13132123001 is 10032123131.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10032123131 = 37 ⋅271138463.
It is a cyclic number.
It is not a de Polignac number, because 13132123001 - 230 = 12058381177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13132123007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211808405 + ... + 211808466.
It is an arithmetic number, because the mean of its divisors is an integer number (3388934976).
Almost surely, 213132123001 is an apocalyptic number.
It is an amenable number.
13132123001 is a deficient number, since it is larger than the sum of its proper divisors (423616903).
13132123001 is an equidigital number, since it uses as much as digits as its factorization.
13132123001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423616902.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13132123001 its reverse (10032123131), we get a palindrome (23164246132).
The spelling of 13132123001 in words is "thirteen billion, one hundred thirty-two million, one hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •