Base | Representation |
---|---|
bin | 1001111011001110001111… |
… | …0100110101010000001011 |
3 | 1102122021110110120210211021 |
4 | 2132303203310311100023 |
5 | 2412244401014200413 |
6 | 35113214144013311 |
7 | 2204304166515655 |
oct | 236634364652013 |
9 | 42567413523737 |
10 | 10913039209483 |
11 | 35282151499a4 |
12 | 128302a901237 |
13 | 6121311640a8 |
14 | 29a2a01696d5 |
15 | 13dd1706918d |
hex | 9ece3d3540b |
10913039209483 has 8 divisors (see below), whose sum is σ = 10931812409840. Its totient is φ = 10894280859360.
The previous prime is 10913039209481. The next prime is 10913039209511. The reversal of 10913039209483 is 38490293031901.
It is a happy number.
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 10913039209483 - 21 = 10913039209481 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10913039209483.
It is not an unprimeable number, because it can be changed into a prime (10913039209481) 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 7 ways as a sum of consecutive naturals, for example, 2241048 + ... + 5181541.
It is an arithmetic number, because the mean of its divisors is an integer number (1366476551230).
Almost surely, 210913039209483 is an apocalyptic number.
10913039209483 is a deficient number, since it is larger than the sum of its proper divisors (18773200357).
10913039209483 is an equidigital number, since it uses as much as digits as its factorization.
10913039209483 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7425117.
The product of its (nonzero) digits is 1259712, while the sum is 52.
The spelling of 10913039209483 in words is "ten trillion, nine hundred thirteen billion, thirty-nine million, two hundred nine thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •