Base | Representation |
---|---|
bin | 1011001011111010001100… |
… | …1000011101111100011001 |
3 | 1121112210110100212102010001 |
4 | 2302332203020131330121 |
5 | 3103002304414240312 |
6 | 42054104254253001 |
7 | 2406406225252225 |
oct | 262764310357431 |
9 | 47483410772101 |
10 | 12299228274457 |
11 | 3a120897a22a3 |
12 | 146780a7b7161 |
13 | 6b2a73688057 |
14 | 307400435785 |
15 | 164de7990057 |
hex | b2fa321df19 |
12299228274457 has 4 divisors (see below), whose sum is σ = 12367939047120. Its totient is φ = 12230517501796.
The previous prime is 12299228274383. The next prime is 12299228274469. The reversal of 12299228274457 is 75447282299221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12299228274457 is a prime.
It is a super-2 number, since 2×122992282744572 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12299228274257) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34355386063 + ... + 34355386420.
It is an arithmetic number, because the mean of its divisors is an integer number (3091984761780).
Almost surely, 212299228274457 is an apocalyptic number.
It is an amenable number.
12299228274457 is a deficient number, since it is larger than the sum of its proper divisors (68710772663).
12299228274457 is an equidigital number, since it uses as much as digits as its factorization.
12299228274457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68710772662.
The product of its digits is 81285120, while the sum is 64.
The spelling of 12299228274457 in words is "twelve trillion, two hundred ninety-nine billion, two hundred twenty-eight million, two hundred seventy-four thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •