Base | Representation |
---|---|
bin | 101101111100001111001000… |
… | …1101111000110000000011001 |
3 | 1221222210212120011202120012002 |
4 | 1123320132101233012000121 |
5 | 410431311002423123231 |
6 | 3551242212012130345 |
7 | 151055323605105236 |
oct | 13370362157060031 |
9 | 1858725504676162 |
10 | 404103033020441 |
11 | 10783a152217527 |
12 | 393a5a601669b5 |
13 | 144639a232c171 |
14 | 71b099676878d |
15 | 31ab9a973b0cb |
hex | 16f8791bc6019 |
404103033020441 has 32 divisors (see below), whose sum is σ = 418586037826560. Its totient is φ = 389902914273600.
The previous prime is 404103033020429. The next prime is 404103033020443. The reversal of 404103033020441 is 144020330301404.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-404103033020441 is a prime.
It is a super-2 number, since 2×4041030330204412 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (404103033020443) 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, 6510304436 + ... + 6510366506.
It is an arithmetic number, because the mean of its divisors is an integer number (13080813682080).
Almost surely, 2404103033020441 is an apocalyptic number.
It is an amenable number.
404103033020441 is a deficient number, since it is larger than the sum of its proper divisors (14483004806119).
404103033020441 is a wasteful number, since it uses less digits than its factorization.
404103033020441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66045.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 404103033020441 its reverse (144020330301404), we get a palindrome (548123363321845).
The spelling of 404103033020441 in words is "four hundred four trillion, one hundred three billion, thirty-three million, twenty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •