Base | Representation |
---|---|
bin | 11111111001001000101010… |
… | …011101111100111011010000 |
3 | 200101122021102121010020220112 |
4 | 133321020222131330323100 |
5 | 121341103231114310233 |
6 | 1214153110435100452 |
7 | 41354603103566621 |
oct | 3771105235747320 |
9 | 611567377106815 |
10 | 140265754447568 |
11 | 407694107350a2 |
12 | 13894539441728 |
13 | 603600870c5c9 |
14 | 268cc821d1a48 |
15 | 113397a495048 |
hex | 7f922a77ced0 |
140265754447568 has 20 divisors (see below), whose sum is σ = 271785273364320. Its totient is φ = 70127619385824.
The previous prime is 140265754447531. The next prime is 140265754447639. The reversal of 140265754447568 is 865744457562041.
140265754447568 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1402657544475682 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140265754447498 and 140265754447507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 328394780 + ... + 328821627.
It is an arithmetic number, because the mean of its divisors is an integer number (13589263668216).
Almost surely, 2140265754447568 is an apocalyptic number.
It is an amenable number.
140265754447568 is a deficient number, since it is larger than the sum of its proper divisors (131519518916752).
140265754447568 is a wasteful number, since it uses less digits than its factorization.
140265754447568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657229754 (or 657229748 counting only the distinct ones).
The product of its (nonzero) digits is 903168000, while the sum is 68.
The spelling of 140265754447568 in words is "one hundred forty trillion, two hundred sixty-five billion, seven hundred fifty-four million, four hundred forty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •