Base | Representation |
---|---|
bin | 1011011000001010000110… |
… | …0010111010101010110110 |
3 | 1122021220121100222020000000 |
4 | 2312002201202322222312 |
5 | 3114424233143112214 |
6 | 42334504534332130 |
7 | 2430535625324406 |
oct | 266024142725266 |
9 | 48256540866000 |
10 | 12509655050934 |
11 | 3a93351171a38 |
12 | 14a05561ba046 |
13 | 6c9869c1c942 |
14 | 313683210806 |
15 | 16a6114c4809 |
hex | b60a18baab6 |
12509655050934 has 48 divisors (see below), whose sum is σ = 28142960102640. Its totient is φ = 4169807044596.
The previous prime is 12509655050927. The next prime is 12509655050951. The reversal of 12509655050934 is 43905055690521.
12509655050934 is a `hidden beast` number, since 1 + 2 + 5 + 0 + 9 + 6 + 550 + 50 + 9 + 34 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 233890407 + ... + 233943885.
It is an arithmetic number, because the mean of its divisors is an integer number (586311668805).
Almost surely, 212509655050934 is an apocalyptic number.
12509655050934 is an abundant number, since it is smaller than the sum of its proper divisors (15633305051706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12509655050934 is an frugal number, since it uses more digits than its factorization.
12509655050934 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106981 (or 53484 counting only the distinct ones).
The product of its (nonzero) digits is 7290000, while the sum is 54.
Multiplying 12509655050934 by its sum of digits (54), we get a square (675521372750436 = 259907942).
12509655050934 divided by its sum of digits (54) gives a square (231660278721 = 4813112).
The spelling of 12509655050934 in words is "twelve trillion, five hundred nine billion, six hundred fifty-five million, fifty thousand, nine hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •