Base | Representation |
---|---|
bin | 1100010100100001100… |
… | …00010001011110100000 |
3 | 1111110200222011220211020 |
4 | 12022100300101132200 |
5 | 23413442323243413 |
6 | 522251054045440 |
7 | 42404434155435 |
oct | 6122060213640 |
9 | 1443628156736 |
10 | 423335368608 |
11 | 1535988631a9 |
12 | 6a0661a9880 |
13 | 30bc702ca69 |
14 | 166bd42db8c |
15 | b02a3a1c23 |
hex | 6290c117a0 |
423335368608 has 96 divisors (see below), whose sum is σ = 1128516883200. Its totient is φ = 138929995776.
The previous prime is 423335368559. The next prime is 423335368667. The reversal of 423335368608 is 806863533324.
It is a tau number, because it is divible by the number of its divisors (96).
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, 2598088 + ... + 2756216.
It is an arithmetic number, because the mean of its divisors is an integer number (11755384200).
Almost surely, 2423335368608 is an apocalyptic number.
423335368608 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 423335368608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (564258441600).
423335368608 is an abundant number, since it is smaller than the sum of its proper divisors (705181514592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423335368608 is a wasteful number, since it uses less digits than its factorization.
423335368608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158574 (or 158566 counting only the distinct ones).
The product of its (nonzero) digits is 7464960, while the sum is 51.
The spelling of 423335368608 in words is "four hundred twenty-three billion, three hundred thirty-five million, three hundred sixty-eight thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •