Base | Representation |
---|---|
bin | 1101110010001110100011… |
… | …00100001011101111100111 |
3 | 10222022220102001211102000111 |
4 | 12321013101210023233213 |
5 | 12433122212113200203 |
6 | 144245351305353451 |
7 | 6246022610526313 |
oct | 671072144135747 |
9 | 128286361742014 |
10 | 30313100131303 |
11 | 9727793843950 |
12 | 3496a6ba98887 |
13 | 13bb6892cb032 |
14 | 76b23a280b43 |
15 | 3787a75b826d |
hex | 1b91d190bbe7 |
30313100131303 has 8 divisors (see below), whose sum is σ = 33372220329360. Its totient is φ = 27304543903680.
The previous prime is 30313100131291. The next prime is 30313100131313.
30313100131303 is nontrivially palindromic in base 10.
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 30313100131303 - 25 = 30313100131271 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30313100131313) 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, 12640991350 + ... + 12640993747.
It is an arithmetic number, because the mean of its divisors is an integer number (4171527541170).
Almost surely, 230313100131303 is an apocalyptic number.
30313100131303 is a deficient number, since it is larger than the sum of its proper divisors (3059120198057).
30313100131303 is a wasteful number, since it uses less digits than its factorization.
30313100131303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25281985217.
The product of its (nonzero) digits is 729, while the sum is 22.
Multiplying 30313100131303 by its sum of digits (22), we get a palindrome (666888202888666).
It can be divided in two parts, 30313100 and 131303, that added together give a palindrome (30444403).
The spelling of 30313100131303 in words is "thirty trillion, three hundred thirteen billion, one hundred million, one hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •