Base | Representation |
---|---|
bin | 111010001001101100001… |
… | …001001001011010011111 |
3 | 112011000201102222121120020 |
4 | 322021230021021122133 |
5 | 1010433040241004323 |
6 | 12255444254323223 |
7 | 561465631615044 |
oct | 72115411113237 |
9 | 15130642877506 |
10 | 3996133922463 |
11 | 1300829469371 |
12 | 5465891b9513 |
13 | 22caabb66ca7 |
14 | db5b1acb1cb |
15 | 6de3688aae3 |
hex | 3a26c24969f |
3996133922463 has 12 divisors (see below), whose sum is σ = 5350565705688. Its totient is φ = 2652942350800.
The previous prime is 3996133922327. The next prime is 3996133922467. The reversal of 3996133922463 is 3642293316993.
It is a happy number.
3996133922463 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3996133922463 - 29 = 3996133921951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3996133922397 and 3996133922406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3996133922467) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11488488 + ... + 11831213.
It is an arithmetic number, because the mean of its divisors is an integer number (445880475474).
Almost surely, 23996133922463 is an apocalyptic number.
3996133922463 is a deficient number, since it is larger than the sum of its proper divisors (1354431783225).
3996133922463 is an equidigital number, since it uses as much as digits as its factorization.
3996133922463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23320182 (or 23319943 counting only the distinct ones).
The product of its digits is 34012224, while the sum is 60.
The spelling of 3996133922463 in words is "three trillion, nine hundred ninety-six billion, one hundred thirty-three million, nine hundred twenty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •