Base | Representation |
---|---|
bin | 1101110001111000001100… |
… | …11000000001010010011111 |
3 | 10222021202102211210020100011 |
4 | 12320330012120001102133 |
5 | 12432423123403431221 |
6 | 144240044515344051 |
7 | 6245116351552366 |
oct | 670740630012237 |
9 | 128252384706304 |
10 | 30301101233311 |
11 | 9722696775227 |
12 | 34946815b2027 |
13 | 13ba4c6460cac |
14 | 76a81c86c7dd |
15 | 378303eb41e1 |
hex | 1b8f0660149f |
30301101233311 has 8 divisors (see below), whose sum is σ = 31618656386784. Its totient is φ = 28983555744000.
The previous prime is 30301101233309. The next prime is 30301101233321. The reversal of 30301101233311 is 11333210110303.
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 30301101233311 - 21 = 30301101233309 is a prime.
It is a super-2 number, since 2×303011012333112 (a number of 28 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 (30301101233321) 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, 4400311 + ... + 8942311.
It is an arithmetic number, because the mean of its divisors is an integer number (3952332048348).
Almost surely, 230301101233311 is an apocalyptic number.
30301101233311 is a deficient number, since it is larger than the sum of its proper divisors (1317555153473).
30301101233311 is a wasteful number, since it uses less digits than its factorization.
30301101233311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4832081.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 30301101233311 its reverse (11333210110303), we get a palindrome (41634311343614).
The spelling of 30301101233311 in words is "thirty trillion, three hundred one billion, one hundred one million, two hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •