Base | Representation |
---|---|
bin | 1101101000111010110000… |
… | …11010011000111111011011 |
3 | 10221012022210110110011222122 |
4 | 12310131120122120333123 |
5 | 12412402123411103313 |
6 | 143442412035411455 |
7 | 6213640306005506 |
oct | 664353032307733 |
9 | 127168713404878 |
10 | 29993239941083 |
11 | 961407502a801 |
12 | 3444a83453b8b |
13 | 1397472a663a3 |
14 | 75997564c13d |
15 | 3702d65a8708 |
hex | 1b4758698fdb |
29993239941083 has 8 divisors (see below), whose sum is σ = 30384072038400. Its totient is φ = 29602687114728.
The previous prime is 29993239941079. The next prime is 29993239941107. The reversal of 29993239941083 is 38014993239992.
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 29993239941083 - 22 = 29993239941079 is a prime.
It is a super-2 number, since 2×299932399410832 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 29993239940998 and 29993239941016.
It is not an unprimeable number, because it can be changed into a prime (29993239841083) 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, 69601541 + ... + 70031142.
It is an arithmetic number, because the mean of its divisors is an integer number (3798009004800).
Almost surely, 229993239941083 is an apocalyptic number.
29993239941083 is a deficient number, since it is larger than the sum of its proper divisors (390832097317).
29993239941083 is a wasteful number, since it uses less digits than its factorization.
29993239941083 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139635481.
The product of its (nonzero) digits is 204073344, while the sum is 71.
The spelling of 29993239941083 in words is "twenty-nine trillion, nine hundred ninety-three billion, two hundred thirty-nine million, nine hundred forty-one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •