Base | Representation |
---|---|
bin | 101101111100001111001111… |
… | …0110111001011000111011011 |
3 | 1221222210220010112010222211101 |
4 | 1123320132132313023013123 |
5 | 410431311430312223311 |
6 | 3551242245520212231 |
7 | 151055332221004456 |
oct | 13370363667130733 |
9 | 1858726115128741 |
10 | 404103253242331 |
11 | 10783a255561495 |
12 | 393a5b01a6a077 |
13 | 14463a08b46886 |
14 | 71b09b7ad249d |
15 | 31ab9bdc3bec1 |
hex | 16f879edcb1db |
404103253242331 has 12 divisors (see below), whose sum is σ = 404950840081200. Its totient is φ = 403257425929280.
The previous prime is 404103253242263. The next prime is 404103253242361. The reversal of 404103253242331 is 133242352301404.
It is not a de Polignac number, because 404103253242331 - 223 = 404103244853723 is a prime.
It is a super-2 number, since 2×4041032532423312 (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 (404103253242361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1595675025 + ... + 1595928253.
It is an arithmetic number, because the mean of its divisors is an integer number (33745903340100).
Almost surely, 2404103253242331 is an apocalyptic number.
404103253242331 is a deficient number, since it is larger than the sum of its proper divisors (847586838869).
404103253242331 is an frugal number, since it uses more digits than its factorization.
404103253242331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260150 (or 259629 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 37.
The spelling of 404103253242331 in words is "four hundred four trillion, one hundred three billion, two hundred fifty-three million, two hundred forty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •