Base | Representation |
---|---|
bin | 1101101111110101101000… |
… | …00101101110101110011001 |
3 | 10222001001111110021010000212 |
4 | 12313322310011232232121 |
5 | 12430301042303331413 |
6 | 144143532533140505 |
7 | 6240055251425516 |
oct | 667726405565631 |
9 | 128031443233025 |
10 | 30231001230233 |
11 | 96a599408a391 |
12 | 3482b7918a735 |
13 | 13b3a043a162b |
14 | 76728c86430d |
15 | 37659ebecca8 |
hex | 1b7eb416eb99 |
30231001230233 has 8 divisors (see below), whose sum is σ = 31877837053920. Its totient is φ = 28589738456160.
The previous prime is 30231001230229. The next prime is 30231001230247. The reversal of 30231001230233 is 33203210013203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30231001230233 - 22 = 30231001230229 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30231001230199 and 30231001230208.
It is not an unprimeable number, because it can be changed into a prime (30231001230253) 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, 1393251260 + ... + 1393272957.
It is an arithmetic number, because the mean of its divisors is an integer number (3984729631740).
Almost surely, 230231001230233 is an apocalyptic number.
It is an amenable number.
30231001230233 is a deficient number, since it is larger than the sum of its proper divisors (1646835823687).
30231001230233 is a wasteful number, since it uses less digits than its factorization.
30231001230233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2786524807.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30231001230233 its reverse (33203210013203), we get a palindrome (63434211243436).
The spelling of 30231001230233 in words is "thirty trillion, two hundred thirty-one billion, one million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •