Base | Representation |
---|---|
bin | 111011000110000111110… |
… | …010010010001001010001 |
3 | 112101020012121201200000111 |
4 | 323012013302102021101 |
5 | 1013013433140403101 |
6 | 12345335143321321 |
7 | 566253626103655 |
oct | 73060762221121 |
9 | 15336177650014 |
10 | 4061022200401 |
11 | 13262a7185a51 |
12 | 557078150241 |
13 | 235c5026691a |
14 | 1007a987ca65 |
15 | 70983327251 |
hex | 3b187c92251 |
4061022200401 has 6 divisors (see below), whose sum is σ = 4162487361206. Its totient is φ = 3961972876800.
The previous prime is 4061022200383. The next prime is 4061022200407. The reversal of 4061022200401 is 1040022201604.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 540520510401 + 3520501690000 = 735201^2 + 1876300^2 .
It is not a de Polignac number, because 4061022200401 - 27 = 4061022200273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4061022200407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1207916880 + ... + 1207920241.
Almost surely, 24061022200401 is an apocalyptic number.
4061022200401 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
4061022200401 is a deficient number, since it is larger than the sum of its proper divisors (101465160805).
4061022200401 is an equidigital number, since it uses as much as digits as its factorization.
4061022200401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2415837203 (or 2415837162 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The spelling of 4061022200401 in words is "four trillion, sixty-one billion, twenty-two million, two hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •