Base | Representation |
---|---|
bin | 1101101111010000011010… |
… | …01100000101110000110001 |
3 | 10221222010221000101002200210 |
4 | 12313220031030011300301 |
5 | 12424434132413430301 |
6 | 144130430200334333 |
7 | 6235450161312354 |
oct | 667501514056061 |
9 | 127863830332623 |
10 | 30211021233201 |
11 | 9698470982946 |
12 | 347b121a743a9 |
13 | 13b1b6bbab593 |
14 | 7663150a829b |
15 | 375cd0ad3ad6 |
hex | 1b7a0d305c31 |
30211021233201 has 8 divisors (see below), whose sum is σ = 41670374114880. Its totient is φ = 19446174586832.
The previous prime is 30211021233193. The next prime is 30211021233221. The reversal of 30211021233201 is 10233212011203.
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 30211021233201 - 23 = 30211021233193 is a prime.
It is a super-3 number, since 3×302110212332013 (a number of 41 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (30211021233221) 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, 173626558725 + ... + 173626558898.
It is an arithmetic number, because the mean of its divisors is an integer number (5208796764360).
Almost surely, 230211021233201 is an apocalyptic number.
It is an amenable number.
30211021233201 is a deficient number, since it is larger than the sum of its proper divisors (11459352881679).
30211021233201 is a wasteful number, since it uses less digits than its factorization.
30211021233201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347253117655.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30211021233201 its reverse (10233212011203), we get a palindrome (40444233244404).
The spelling of 30211021233201 in words is "thirty trillion, two hundred eleven billion, twenty-one million, two hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •