Base | Representation |
---|---|
bin | 1001001000000000010010… |
… | …0111101101101011001111 |
3 | 1022112011020110110122002111 |
4 | 2102000010213231223033 |
5 | 2303340313001414043 |
6 | 33201052513404451 |
7 | 2053604044265215 |
oct | 222000447555317 |
9 | 38464213418074 |
10 | 10033121123023 |
11 | 3219028346a69 |
12 | 116059bb69727 |
13 | 57a172032c7b |
14 | 269869caccb5 |
15 | 125eb7a8909d |
hex | 920049edacf |
10033121123023 has 8 divisors (see below), whose sum is σ = 10201710014496. Its totient is φ = 9865289935200.
The previous prime is 10033121122993. The next prime is 10033121123131. The reversal of 10033121123023 is 32032112133001.
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 10033121123023 - 217 = 10033120991951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10033121122985 and 10033121123003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10033121123323) 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, 189399208 + ... + 189452173.
It is an arithmetic number, because the mean of its divisors is an integer number (1275213751812).
Almost surely, 210033121123023 is an apocalyptic number.
10033121123023 is a deficient number, since it is larger than the sum of its proper divisors (168588891473).
10033121123023 is an equidigital number, since it uses as much as digits as its factorization.
10033121123023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378851825.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10033121123023 its reverse (32032112133001), we get a palindrome (42065233256024).
The spelling of 10033121123023 in words is "ten trillion, thirty-three billion, one hundred twenty-one million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •