Base | Representation |
---|---|
bin | 11011111110100101… |
… | …011110100101000111 |
3 | 2212112121112000100102 |
4 | 123332211132211013 |
5 | 443011001304343 |
6 | 21444535434315 |
7 | 2112305431364 |
oct | 337645364507 |
9 | 85477460312 |
10 | 30041041223 |
11 | 118164259a6 |
12 | 59a482599b |
13 | 2aa9a3484b |
14 | 164da8d46b |
15 | bac5343b8 |
hex | 6fe95e947 |
30041041223 has 4 divisors (see below), whose sum is σ = 30041388048. Its totient is φ = 30040694400.
The previous prime is 30041041193. The next prime is 30041041231. The reversal of 30041041223 is 32214014003.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 30041041223 - 230 = 28967299399 is a prime.
It is a super-3 number, since 3×300410412233 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30041041195 and 30041041204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30041041123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78398 + ... + 257348.
It is an arithmetic number, because the mean of its divisors is an integer number (7510347012).
Almost surely, 230041041223 is an apocalyptic number.
30041041223 is a deficient number, since it is larger than the sum of its proper divisors (346825).
30041041223 is a wasteful number, since it uses less digits than its factorization.
30041041223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346824.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 30041041223 its reverse (32214014003), we get a palindrome (62255055226).
The spelling of 30041041223 in words is "thirty billion, forty-one million, forty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •