Base | Representation |
---|---|
bin | 111010001101100000010… |
… | …010111100101011000101 |
3 | 112011102021220201122021011 |
4 | 322031200102330223011 |
5 | 1011014432403214141 |
6 | 12301402542322221 |
7 | 562002301050115 |
oct | 72154022745305 |
9 | 15142256648234 |
10 | 4000230132421 |
11 | 1302540695556 |
12 | 547330b89371 |
13 | 2302b26a3073 |
14 | db87db27045 |
15 | 6e0c62b7881 |
hex | 3a3604bcac5 |
4000230132421 has 32 divisors (see below), whose sum is σ = 4225192611840. Its totient is φ = 3782112998400.
The previous prime is 4000230132401. The next prime is 4000230132439. The reversal of 4000230132421 is 1242310320004.
It is a cyclic number.
It is not a de Polignac number, because 4000230132421 - 225 = 4000196577989 is a prime.
It is a super-2 number, since 2×40002301324212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4000230132392 and 4000230132401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4000230132401) 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, 396410586 + ... + 396420676.
It is an arithmetic number, because the mean of its divisors is an integer number (132037269120).
Almost surely, 24000230132421 is an apocalyptic number.
It is an amenable number.
4000230132421 is a deficient number, since it is larger than the sum of its proper divisors (224962479419).
4000230132421 is a wasteful number, since it uses less digits than its factorization.
4000230132421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11497.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 4000230132421 its reverse (1242310320004), we get a palindrome (5242540452425).
The spelling of 4000230132421 in words is "four trillion, two hundred thirty million, one hundred thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •