Base | Representation |
---|---|
bin | 1001011001011010011111… |
… | …1101011010101011100111 |
3 | 1100120202020202221022222102 |
4 | 2112112213331122223213 |
5 | 2323240333321221043 |
6 | 33550315333122315 |
7 | 2114322620662622 |
oct | 226264775325347 |
9 | 40522222838872 |
10 | 10332214242023 |
11 | 332395a641133 |
12 | 11aa55178939b |
13 | 59c428cc91ab |
14 | 27a1207c2db9 |
15 | 12db7080c6b8 |
hex | 965a7f5aae7 |
10332214242023 has 8 divisors (see below), whose sum is σ = 10354512126816. Its totient is φ = 10309925808000.
The previous prime is 10332214241929. The next prime is 10332214242073. The reversal of 10332214242023 is 32024241223301.
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 10332214242023 - 226 = 10332147133159 is a prime.
It is a super-2 number, since 2×103322142420232 (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 (10332214242073) 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, 171611 + ... + 4549052.
It is an arithmetic number, because the mean of its divisors is an integer number (1294314015852).
Almost surely, 210332214242023 is an apocalyptic number.
10332214242023 is a deficient number, since it is larger than the sum of its proper divisors (22297884793).
10332214242023 is an equidigital number, since it uses as much as digits as its factorization.
10332214242023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4725385.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 10332214242023 its reverse (32024241223301), we get a palindrome (42356455465324).
The spelling of 10332214242023 in words is "ten trillion, three hundred thirty-two billion, two hundred fourteen million, two hundred forty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •