Base | Representation |
---|---|
bin | 100100011001001000001111… |
… | …0111110111110100011011111 |
3 | 1112222102111122220212101201221 |
4 | 1020302100132332332203133 |
5 | 313424212432204043403 |
6 | 3052453520423114211 |
7 | 124266255052463251 |
oct | 11062203676764337 |
9 | 1488374586771657 |
10 | 320113022331103 |
11 | 92aa819685a771 |
12 | 2baa006b5a2967 |
13 | 109806b40b8441 |
14 | 59097a5413cd1 |
15 | 2701d1ace2dbd |
hex | 123241efbe8df |
320113022331103 has 32 divisors (see below), whose sum is σ = 330933822912000. Its totient is φ = 309460001026176.
The previous prime is 320113022331061. The next prime is 320113022331127. The reversal of 320113022331103 is 301133220311023.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-320113022331103 is a prime.
It is a super-2 number, since 2×3201130223311032 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (320113022301103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10924225950 + ... + 10924255252.
It is an arithmetic number, because the mean of its divisors is an integer number (10341681966000).
Almost surely, 2320113022331103 is an apocalyptic number.
320113022331103 is a deficient number, since it is larger than the sum of its proper divisors (10820800580897).
320113022331103 is a wasteful number, since it uses less digits than its factorization.
320113022331103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35071.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 320113022331103 its reverse (301133220311023), we get a palindrome (621246242642126).
The spelling of 320113022331103 in words is "three hundred twenty trillion, one hundred thirteen billion, twenty-two million, three hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •