Base | Representation |
---|---|
bin | 111111000001111011100… |
… | …011110000000110100000 |
3 | 120100002002201021012111101 |
4 | 333001323203300012200 |
5 | 1031431201400112000 |
6 | 13113452342124144 |
7 | 624635062364566 |
oct | 77017343600640 |
9 | 16302081235441 |
10 | 4331400004000 |
11 | 141aa334236a3 |
12 | 59b555120654 |
13 | 2555ac06c964 |
14 | 10d8d87dda36 |
15 | 77a0a138e6a |
hex | 3f07b8f01a0 |
4331400004000 has 48 divisors (see below), whose sum is σ = 10642249819656. Its totient is φ = 1732560000000.
The previous prime is 4331400003941. The next prime is 4331400004003. The reversal of 4331400004000 is 4000041334.
It can be written as a sum of positive squares in 4 ways, for example, as 2591417404944 + 1739982599056 = 1609788^2 + 1319084^2 .
It is a super-2 number, since 2×43314000040002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4331400004003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 541421001 + ... + 541429000.
Almost surely, 24331400004000 is an apocalyptic number.
4331400004000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4331400004000 is an abundant number, since it is smaller than the sum of its proper divisors (6310849815656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4331400004000 is a wasteful number, since it uses less digits than its factorization.
4331400004000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1082850026 (or 1082850008 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 4331400004000 its reverse (4000041334), we get a palindrome (4335400045334).
The spelling of 4331400004000 in words is "four trillion, three hundred thirty-one billion, four hundred million, four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •