Base | Representation |
---|---|
bin | 1001010010011110011101… |
… | …1011100011100111000010 |
3 | 1100011100120220222122111112 |
4 | 2110213213123203213002 |
5 | 2314312231111220414 |
6 | 33415444023243322 |
7 | 2102603104562600 |
oct | 224474733434702 |
9 | 40140526878445 |
10 | 10213020023234 |
11 | 32883546063a6 |
12 | 118b4278a9542 |
13 | 591111a3a252 |
14 | 2744544ac870 |
15 | 12a9e6471d3e |
hex | 949e76e39c2 |
10213020023234 has 48 divisors (see below), whose sum is σ = 18397184921856. Its totient is φ = 4235435618400.
The previous prime is 10213020023233. The next prime is 10213020023273. The reversal of 10213020023234 is 43232002031201.
It is a super-2 number, since 2×102130200232342 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10213020023233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35159957 + ... + 35449239.
It is an arithmetic number, because the mean of its divisors is an integer number (383274685872).
Almost surely, 210213020023234 is an apocalyptic number.
10213020023234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10213020023234 is a deficient number, since it is larger than the sum of its proper divisors (8184164898622).
10213020023234 is a wasteful number, since it uses less digits than its factorization.
10213020023234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300951 (or 300944 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 10213020023234 its reverse (43232002031201), we get a palindrome (53445022054435).
The spelling of 10213020023234 in words is "ten trillion, two hundred thirteen billion, twenty million, twenty-three thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •