Base | Representation |
---|---|
bin | 1101101111010000011010… |
… | …10011101101010100011001 |
3 | 10221222010221011010120002221 |
4 | 12313220031103231110121 |
5 | 12424434133421331413 |
6 | 144130430311224041 |
7 | 6235450214300536 |
oct | 667501523552431 |
9 | 127863834116087 |
10 | 30211023230233 |
11 | 969847201728a |
12 | 347b122678021 |
13 | 13b1b6c42a561 |
14 | 766315467d8d |
15 | 375cd0d7a68d |
hex | 1b7a0d4ed519 |
30211023230233 has 8 divisors (see below), whose sum is σ = 30459638449152. Its totient is φ = 29962575716976.
The previous prime is 30211023230203. The next prime is 30211023230251. The reversal of 30211023230233 is 33203232011203.
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 30211023230233 - 221 = 30211021133081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30211023230198 and 30211023230207.
It is not an unprimeable number, because it can be changed into a prime (30211023230203) 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, 41564635 + ... + 42285232.
It is an arithmetic number, because the mean of its divisors is an integer number (3807454806144).
Almost surely, 230211023230233 is an apocalyptic number.
It is an amenable number.
30211023230233 is a deficient number, since it is larger than the sum of its proper divisors (248615218919).
30211023230233 is a wasteful number, since it uses less digits than its factorization.
30211023230233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83852831.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 30211023230233 its reverse (33203232011203), we get a palindrome (63414255241436).
The spelling of 30211023230233 in words is "thirty trillion, two hundred eleven billion, twenty-three million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •