Base | Representation |
---|---|
bin | 1011100101100101101… |
… | …10111100000101000000 |
3 | 1102001122220101122010222 |
4 | 11302302312330011000 |
5 | 23010341230100121 |
6 | 502522453242212 |
7 | 40523136634250 |
oct | 5626266740500 |
9 | 1361586348128 |
10 | 398137737536 |
11 | 143938412010 |
12 | 651b3633368 |
13 | 2b70c88b5a6 |
14 | 153acb1d960 |
15 | a5531920ab |
hex | 5cb2dbc140 |
398137737536 has 224 divisors, whose sum is σ = 1011260270592. Its totient is φ = 151007754240.
The previous prime is 398137737533. The next prime is 398137737551. The reversal of 398137737536 is 635737731893.
It is a tau number, because it is divible by the number of its divisors (224).
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (398137737533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67170605 + ... + 67176531.
Almost surely, 2398137737536 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 398137737536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (505630135296).
398137737536 is an abundant number, since it is smaller than the sum of its proper divisors (613122533056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
398137737536 is a wasteful number, since it uses less digits than its factorization.
398137737536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6317 (or 6307 counting only the distinct ones).
The product of its digits is 60011280, while the sum is 62.
The spelling of 398137737536 in words is "three hundred ninety-eight billion, one hundred thirty-seven million, seven hundred thirty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •