Base | Representation |
---|---|
bin | 1001010010000101001110… |
… | …0011100000100011101111 |
3 | 1100010201002200220201120021 |
4 | 2110201103203200203233 |
5 | 2314204341443100443 |
6 | 33412403412103011 |
7 | 2102243146361266 |
oct | 224412343404357 |
9 | 40121080821507 |
10 | 10206244112623 |
11 | 32854977a8479 |
12 | 118a056604a67 |
13 | 5905a1ca41a0 |
14 | 273db06055dd |
15 | 12a74b66e9ed |
hex | 948538e08ef |
10206244112623 has 8 divisors (see below), whose sum is σ = 10991380614368. Its totient is φ = 9421113439584.
The previous prime is 10206244112551. The next prime is 10206244112641. The reversal of 10206244112623 is 32621144260201.
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 10206244112623 - 221 = 10206242015471 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206244112663) 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, 2597461 + ... + 5211457.
It is an arithmetic number, because the mean of its divisors is an integer number (1373922576796).
Almost surely, 210206244112623 is an apocalyptic number.
10206244112623 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10206244112623 is a deficient number, since it is larger than the sum of its proper divisors (785136501745).
10206244112623 is a wasteful number, since it uses less digits than its factorization.
10206244112623 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2914353.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 10206244112623 its reverse (32621144260201), we get a palindrome (42827388372824).
The spelling of 10206244112623 in words is "ten trillion, two hundred six billion, two hundred forty-four million, one hundred twelve thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •