Base | Representation |
---|---|
bin | 11101011111001111001… |
… | …00001010101010100001 |
3 | 10120212020210221101201012 |
4 | 32233213210022222201 |
5 | 113100014244113241 |
6 | 2053243030150305 |
7 | 133126045503554 |
oct | 16574744125241 |
9 | 3525223841635 |
10 | 1013202332321 |
11 | 360773336643 |
12 | 1444474b2395 |
13 | 747105602ba |
14 | 37079a0069b |
15 | 1b5508336eb |
hex | ebe790aaa1 |
1013202332321 has 8 divisors (see below), whose sum is σ = 1019004441000. Its totient is φ = 1007402469120.
The previous prime is 1013202332243. The next prime is 1013202332339. The reversal of 1013202332321 is 1232332023101.
It can be written as a sum of positive squares in 4 ways, for example, as 25166332321 + 988036000000 = 158639^2 + 994000^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1013202332321 - 230 = 1012128590497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013202332921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 347855 + ... + 1465403.
It is an arithmetic number, because the mean of its divisors is an integer number (127375555125).
Almost surely, 21013202332321 is an apocalyptic number.
It is an amenable number.
1013202332321 is a deficient number, since it is larger than the sum of its proper divisors (5802108679).
1013202332321 is a wasteful number, since it uses less digits than its factorization.
1013202332321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122739.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1013202332321 its reverse (1232332023101), we get a palindrome (2245534355422).
The spelling of 1013202332321 in words is "one trillion, thirteen billion, two hundred two million, three hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •