Base | Representation |
---|---|
bin | 11100000010100100101011… |
… | …111111011110111101000101 |
3 | 121011122110222120001200012221 |
4 | 130002210223333132331011 |
5 | 112131002212303012242 |
6 | 1114141223430412341 |
7 | 34655505305426002 |
oct | 3402445377367505 |
9 | 534573876050187 |
10 | 123322134032197 |
11 | 36326694729181 |
12 | 119b87a52010b1 |
13 | 53a72c5608339 |
14 | 2264b749788a9 |
15 | e3cd59810167 |
hex | 70292bfdef45 |
123322134032197 has 8 divisors (see below), whose sum is σ = 124760036047680. Its totient is φ = 121890311941440.
The previous prime is 123322134032183. The next prime is 123322134032219. The reversal of 123322134032197 is 791230431223321.
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 123322134032197 - 227 = 123321999814469 is a prime.
It is a super-2 number, since 2×1233221340321972 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123322134032107) 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, 1519940379 + ... + 1520021512.
It is an arithmetic number, because the mean of its divisors is an integer number (15595004505960).
Almost surely, 2123322134032197 is an apocalyptic number.
It is an amenable number.
123322134032197 is a deficient number, since it is larger than the sum of its proper divisors (1437902015483).
123322134032197 is a wasteful number, since it uses less digits than its factorization.
123322134032197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3039962363.
The product of its (nonzero) digits is 326592, while the sum is 43.
The spelling of 123322134032197 in words is "one hundred twenty-three trillion, three hundred twenty-two billion, one hundred thirty-four million, thirty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.171 sec. • engine limits •