Base | Representation |
---|---|
bin | 1011000111111000010011… |
… | …1111011000110101010101 |
3 | 1121022011202221111020110022 |
4 | 2301332010333120311111 |
5 | 3100334021243213023 |
6 | 42002215202434525 |
7 | 2401405610062145 |
oct | 261760477306525 |
9 | 47264687436408 |
10 | 12230003101013 |
11 | 3995795a07955 |
12 | 145630b362a45 |
13 | 6a939091b469 |
14 | 303d146b4925 |
15 | 1631e53d27c8 |
hex | b1f84fd8d55 |
12230003101013 has 8 divisors (see below), whose sum is σ = 12402983217600. Its totient is φ = 12057043166560.
The previous prime is 12230003101009. The next prime is 12230003101163. The reversal of 12230003101013 is 31010130003221.
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 12230003101013 - 22 = 12230003101009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12230003100982 and 12230003101000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230003101313) 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, 3822920 + ... + 6250977.
It is an arithmetic number, because the mean of its divisors is an integer number (1550372902200).
Almost surely, 212230003101013 is an apocalyptic number.
It is an amenable number.
12230003101013 is a deficient number, since it is larger than the sum of its proper divisors (172980116587).
12230003101013 is a wasteful number, since it uses less digits than its factorization.
12230003101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10091067.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 12230003101013 its reverse (31010130003221), we get a palindrome (43240133104234).
The spelling of 12230003101013 in words is "twelve trillion, two hundred thirty billion, three million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •