Base | Representation |
---|---|
bin | 111011101110011100001… |
… | …100100101100100101000 |
3 | 112112100221201110212000020 |
4 | 323232130030211210220 |
5 | 1014221113431004000 |
6 | 12421255043440440 |
7 | 602345510016456 |
oct | 73563414454450 |
9 | 15470851425006 |
10 | 4104314313000 |
11 | 13426a2480a00 |
12 | 56353a686120 |
13 | 23a05c3993b5 |
14 | 1029153719d6 |
15 | 71b68d54ba0 |
hex | 3bb9c325928 |
4104314313000 has 192 divisors, whose sum is σ = 14075424941760. Its totient is φ = 994985200000.
The previous prime is 4104314312977. The next prime is 4104314313089. The reversal of 4104314313000 is 3134134014.
4104314313000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5290326 + ... + 6016325.
It is an arithmetic number, because the mean of its divisors is an integer number (73309504905).
Almost surely, 24104314313000 is an apocalyptic number.
4104314313000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4104314313000 is an abundant number, since it is smaller than the sum of its proper divisors (9971110628760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4104314313000 is a wasteful number, since it uses less digits than its factorization.
4104314313000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11306697 (or 11306672 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 4104314313000 its reverse (3134134014), we get a palindrome (4107448447014).
The spelling of 4104314313000 in words is "four trillion, one hundred four billion, three hundred fourteen million, three hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •