Base | Representation |
---|---|
bin | 1001010111111111110… |
… | …10011111001010111101 |
3 | 1010210110011200102221200 |
4 | 10223333322133022331 |
5 | 20234201000231023 |
6 | 403551433050113 |
7 | 32162314122204 |
oct | 4537772371275 |
9 | 1123404612850 |
10 | 322121102013 |
11 | 114679a67697 |
12 | 52519856939 |
13 | 244b6aa2299 |
14 | 1183b00823b |
15 | 85a475e743 |
hex | 4affe9f2bd |
322121102013 has 12 divisors (see below), whose sum is σ = 466772577180. Its totient is φ = 214061305536.
The previous prime is 322121102011. The next prime is 322121102087. The reversal of 322121102013 is 310201121223.
It can be written as a sum of positive squares in 2 ways, for example, as 133811103204 + 188309998809 = 365802^2 + 433947^2 .
It is not a de Polignac number, because 322121102013 - 21 = 322121102011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (322121102011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 57171678 + ... + 57177311.
It is an arithmetic number, because the mean of its divisors is an integer number (38897714765).
Almost surely, 2322121102013 is an apocalyptic number.
It is an amenable number.
322121102013 is a deficient number, since it is larger than the sum of its proper divisors (144651475167).
322121102013 is a wasteful number, since it uses less digits than its factorization.
322121102013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114349308 (or 114349305 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 322121102013 its reverse (310201121223), we get a palindrome (632322223236).
It can be divided in two parts, 32212 and 1102013, that added together give a square (1134225 = 10652).
The spelling of 322121102013 in words is "three hundred twenty-two billion, one hundred twenty-one million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •