Base | Representation |
---|---|
bin | 1001000111010110111010… |
… | …0010111001111011110100 |
3 | 1022111002120100020001220212 |
4 | 2101311232202321323310 |
5 | 2303200040404024044 |
6 | 33152014355244552 |
7 | 2053031555605235 |
oct | 221655642717364 |
9 | 38432510201825 |
10 | 10022013345524 |
11 | 3214348295364 |
12 | 115a3bbba9758 |
13 | 5790c19a0a6b |
14 | 2690d498508c |
15 | 125a6780aa9e |
hex | 91d6e8b9ef4 |
10022013345524 has 6 divisors (see below), whose sum is σ = 17538523354674. Its totient is φ = 5011006672760.
The previous prime is 10022013345517. The next prime is 10022013345527. The reversal of 10022013345524 is 42554331022001.
It can be written as a sum of positive squares in only one way, i.e., 9496196928100 + 525816417424 = 3081590^2 + 725132^2 .
It is a super-2 number, since 2×100220133455242 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022013345527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1252751668187 + ... + 1252751668194.
It is an arithmetic number, because the mean of its divisors is an integer number (2923087225779).
Almost surely, 210022013345524 is an apocalyptic number.
It is an amenable number.
10022013345524 is a deficient number, since it is larger than the sum of its proper divisors (7516510009150).
10022013345524 is a wasteful number, since it uses less digits than its factorization.
10022013345524 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2505503336385 (or 2505503336383 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 10022013345524 its reverse (42554331022001), we get a palindrome (52576344367525).
The spelling of 10022013345524 in words is "ten trillion, twenty-two billion, thirteen million, three hundred forty-five thousand, five hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •