Base | Representation |
---|---|
bin | 1101110001110110101101… |
… | …01100101000101010110011 |
3 | 10222021200101002121222211012 |
4 | 12320323112230220222303 |
5 | 12432420004120043443 |
6 | 144235433302541135 |
7 | 6245060466524135 |
oct | 670732654505263 |
9 | 128250332558735 |
10 | 30300301331123 |
11 | 97223161a093a |
12 | 34944997377ab |
13 | 13ba3c98137a5 |
14 | 76a78452b055 |
15 | 3782a8b5b118 |
hex | 1b8ed6b28ab3 |
30300301331123 has 16 divisors (see below), whose sum is σ = 31739381853696. Its totient is φ = 28871370612480.
The previous prime is 30300301331099. The next prime is 30300301331143. The reversal of 30300301331123 is 32113310300303.
It is a cyclic number.
It is not a de Polignac number, because 30300301331123 - 230 = 30299227589299 is a prime.
It is a super-2 number, since 2×303003013311232 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30300301331143) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 147317411 + ... + 147522947.
It is an arithmetic number, because the mean of its divisors is an integer number (1983711365856).
Almost surely, 230300301331123 is an apocalyptic number.
30300301331123 is a deficient number, since it is larger than the sum of its proper divisors (1439080522573).
30300301331123 is a wasteful number, since it uses less digits than its factorization.
30300301331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230194.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 30300301331123 its reverse (32113310300303), we get a palindrome (62413611631426).
The spelling of 30300301331123 in words is "thirty trillion, three hundred billion, three hundred one million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •