Base | Representation |
---|---|
bin | 1011001100111100001110… |
… | …1100110010011111100001 |
3 | 1121121111012201221210102211 |
4 | 2303033003230302133201 |
5 | 3103300110330122110 |
6 | 42110155241442121 |
7 | 2410604421062605 |
oct | 263170354623741 |
9 | 47544181853384 |
10 | 12316954535905 |
11 | 3a19655807948 |
12 | 146b1371a0341 |
13 | 6b4639c83c56 |
14 | 308202767505 |
15 | 1655d3cc598a |
hex | b33c3b327e1 |
12316954535905 has 8 divisors (see below), whose sum is σ = 14780385374184. Its totient is φ = 9853537008000.
The previous prime is 12316954535869. The next prime is 12316954535927. The reversal of 12316954535905 is 50953545961321.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 977948921569 + 11339005614336 = 988913^2 + 3367344^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-12316954535905 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 12316954535905.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1163886 + ... + 5097895.
It is an arithmetic number, because the mean of its divisors is an integer number (1847548171773).
Almost surely, 212316954535905 is an apocalyptic number.
It is an amenable number.
12316954535905 is a deficient number, since it is larger than the sum of its proper divisors (2463430838279).
12316954535905 is an equidigital number, since it uses as much as digits as its factorization.
12316954535905 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6655187.
The product of its (nonzero) digits is 21870000, while the sum is 58.
The spelling of 12316954535905 in words is "twelve trillion, three hundred sixteen billion, nine hundred fifty-four million, five hundred thirty-five thousand, nine hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •