Base | Representation |
---|---|
bin | 1011110110100101001011… |
… | …1111000001111111011001 |
3 | 1201010212200222222122002211 |
4 | 2331221102333001333121 |
5 | 3202010144143443001 |
6 | 43414544435155121 |
7 | 2513361054003361 |
oct | 275512277017731 |
9 | 51125628878084 |
10 | 13032323031001 |
11 | 4174a8266535a |
12 | 1565902745aa1 |
13 | 736c343ca571 |
14 | 330aa6bb59a1 |
15 | 1790021d1351 |
hex | bda52fc1fd9 |
13032323031001 has 4 divisors (see below), whose sum is σ = 13049182440612. Its totient is φ = 13015463621392.
The previous prime is 13032323030977. The next prime is 13032323031041. The reversal of 13032323031001 is 10013032323031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 564722190400 + 12467600840601 = 751480^2 + 3530949^2 .
It is a cyclic number.
It is not a de Polignac number, because 13032323031001 - 213 = 13032323022809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13032323031041) 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, 8429703646 + ... + 8429705191.
It is an arithmetic number, because the mean of its divisors is an integer number (3262295610153).
Almost surely, 213032323031001 is an apocalyptic number.
It is an amenable number.
13032323031001 is a deficient number, since it is larger than the sum of its proper divisors (16859409611).
13032323031001 is an equidigital number, since it uses as much as digits as its factorization.
13032323031001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16859409610.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13032323031001 its reverse (10013032323031), we get a palindrome (23045355354032).
The spelling of 13032323031001 in words is "thirteen trillion, thirty-two billion, three hundred twenty-three million, thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •