Base | Representation |
---|---|
bin | 1001000111011010101111… |
… | …1011100111011000111111 |
3 | 1022111012020010010210102011 |
4 | 2101312223323213120333 |
5 | 2303204143031431333 |
6 | 33152304505312051 |
7 | 2053066232526520 |
oct | 221665373473077 |
9 | 38435203123364 |
10 | 10023043233343 |
11 | 3214826672318 |
12 | 115a648a95627 |
13 | 579227173b3a |
14 | 269191672847 |
15 | 125ac7e429cd |
hex | 91dabee763f |
10023043233343 has 8 divisors (see below), whose sum is σ = 11462427842688. Its totient is φ = 8585538946584.
The previous prime is 10023043233331. The next prime is 10023043233349. The reversal of 10023043233343 is 34333234032001.
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 10023043233343 - 29 = 10023043232831 is a prime.
It is a super-2 number, since 2×100230432333432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023043233349) 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, 470069221 + ... + 470090542.
It is an arithmetic number, because the mean of its divisors is an integer number (1432803480336).
Almost surely, 210023043233343 is an apocalyptic number.
10023043233343 is a deficient number, since it is larger than the sum of its proper divisors (1439384609345).
10023043233343 is an equidigital number, since it uses as much as digits as its factorization.
10023043233343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 940161293.
The product of its (nonzero) digits is 46656, while the sum is 31.
Adding to 10023043233343 its reverse (34333234032001), we get a palindrome (44356277265344).
The spelling of 10023043233343 in words is "ten trillion, twenty-three billion, forty-three million, two hundred thirty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •