Base | Representation |
---|---|
bin | 1001100100110111100110… |
… | …1011100111001100011011 |
3 | 1101021120012112221121111102 |
4 | 2121031321223213030123 |
5 | 2340001401104141423 |
6 | 34220543030222015 |
7 | 2134460410015541 |
oct | 231157153471433 |
9 | 41246175847442 |
10 | 10529006318363 |
11 | 339a365637855 |
12 | 1220712ab490b |
13 | 5b4b5b834090 |
14 | 28586c815d91 |
15 | 133d3c31ac28 |
hex | 99379ae731b |
10529006318363 has 16 divisors (see below), whose sum is σ = 11688409797120. Its totient is φ = 9423393760416.
The previous prime is 10529006318357. The next prime is 10529006318387. The reversal of 10529006318363 is 36381360092501.
It is a cyclic number.
It is not a de Polignac number, because 10529006318363 - 228 = 10528737882907 is a prime.
It is a super-2 number, since 2×105290063183632 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10529006311363) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 80459933 + ... + 80590686.
It is an arithmetic number, because the mean of its divisors is an integer number (730525612320).
Almost surely, 210529006318363 is an apocalyptic number.
10529006318363 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10529006318363 is a deficient number, since it is larger than the sum of its proper divisors (1159403478757).
10529006318363 is a wasteful number, since it uses less digits than its factorization.
10529006318363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161050786.
The product of its (nonzero) digits is 699840, while the sum is 47.
The spelling of 10529006318363 in words is "ten trillion, five hundred twenty-nine billion, six million, three hundred eighteen thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •