Base | Representation |
---|---|
bin | 10100000101000101010… |
… | …010010011111101011100 |
3 | 11212220121220102210000210 |
4 | 110011011102103331130 |
5 | 140101411303232033 |
6 | 2533520512252420 |
7 | 201455615246502 |
oct | 24050522237534 |
9 | 4786556383023 |
10 | 1379846930268 |
11 | 49220a68a764 |
12 | 1a350bb41110 |
13 | a01715c7041 |
14 | 4aadbc7a672 |
15 | 25d5dc59d63 |
hex | 14145493f5c |
1379846930268 has 24 divisors (see below), whose sum is σ = 3219665155840. Its totient is φ = 459945788400.
The previous prime is 1379846930251. The next prime is 1379846930303. The reversal of 1379846930268 is 8620396489731.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1379846930199 and 1379846930208.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1965693 + ... + 2573643.
Almost surely, 21379846930268 is an apocalyptic number.
It is an amenable number.
1379846930268 is an abundant number, since it is smaller than the sum of its proper divisors (1839818225572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1379846930268 is a wasteful number, since it uses less digits than its factorization.
1379846930268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 797097 (or 797095 counting only the distinct ones).
The product of its (nonzero) digits is 94058496, while the sum is 66.
The spelling of 1379846930268 in words is "one trillion, three hundred seventy-nine billion, eight hundred forty-six million, nine hundred thirty thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •