Base | Representation |
---|---|
bin | 10100011110101011111… |
… | …110011111110111000000 |
3 | 11222112120220201202111021 |
4 | 110132223332133313000 |
5 | 141024212413440102 |
6 | 2554304535355224 |
7 | 203451121110553 |
oct | 24365376376700 |
9 | 4875526652437 |
10 | 1407339593152 |
11 | 4a2938569259 |
12 | 1a8903222b14 |
13 | a29333911bc |
14 | 4c1892c469a |
15 | 2691c6a9137 |
hex | 147abf9fdc0 |
1407339593152 has 112 divisors (see below), whose sum is σ = 2983852523520. Its totient is φ = 657120844800.
The previous prime is 1407339593129. The next prime is 1407339593197. The reversal of 1407339593152 is 2513959337041.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 1407339593152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121452703 + ... + 121464289.
Almost surely, 21407339593152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1407339593152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1491926261760).
1407339593152 is an abundant number, since it is smaller than the sum of its proper divisors (1576512930368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1407339593152 is a wasteful number, since it uses less digits than its factorization.
1407339593152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13770 (or 13760 counting only the distinct ones).
The product of its (nonzero) digits is 3061800, while the sum is 52.
The spelling of 1407339593152 in words is "one trillion, four hundred seven billion, three hundred thirty-nine million, five hundred ninety-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •