Base | Representation |
---|---|
bin | 11100001100000001010000… |
… | …101101111011011100000001 |
3 | 121020221112120101000021100001 |
4 | 130030001100231323130001 |
5 | 112222121200300431321 |
6 | 1115355342521200001 |
7 | 35053426066300231 |
oct | 3414012055733401 |
9 | 536845511007301 |
10 | 123971290248961 |
11 | 36556a24469a01 |
12 | 11aa2572330001 |
13 | 542359a262b2c |
14 | 2288357467cc1 |
15 | e4eb9edecc91 |
hex | 70c050b7b701 |
123971290248961 has 8 divisors (see below), whose sum is σ = 124716277736064. Its totient is φ = 123226334243520.
The previous prime is 123971290248851. The next prime is 123971290248973. The reversal of 123971290248961 is 169842092179321.
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 123971290248961 - 27 = 123971290248833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123971290248893 and 123971290248902.
It is not an unprimeable number, because it can be changed into a prime (123971290248991) 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, 52921 + ... + 15746281.
It is an arithmetic number, because the mean of its divisors is an integer number (15589534717008).
Almost surely, 2123971290248961 is an apocalyptic number.
It is an amenable number.
123971290248961 is a deficient number, since it is larger than the sum of its proper divisors (744987487103).
123971290248961 is a wasteful number, since it uses less digits than its factorization.
123971290248961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15740831.
The product of its (nonzero) digits is 23514624, while the sum is 64.
The spelling of 123971290248961 in words is "one hundred twenty-three trillion, nine hundred seventy-one billion, two hundred ninety million, two hundred forty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •