Base | Representation |
---|---|
bin | 1001110000011000110… |
… | …00010100101110101001 |
3 | 1012001020201110002210112 |
4 | 10320030120110232221 |
5 | 20443010034331131 |
6 | 413555024024105 |
7 | 33134641531160 |
oct | 4701430245651 |
9 | 1161221402715 |
10 | 335215152041 |
11 | 11a18923a240 |
12 | 54b72a62035 |
13 | 257c27b3493 |
14 | 123200563d7 |
15 | 8abe08d02b |
hex | 4e0c614ba9 |
335215152041 has 32 divisors (see below), whose sum is σ = 441639198720. Its totient is φ = 246495744000.
The previous prime is 335215151983. The next prime is 335215152043. The reversal of 335215152041 is 140251512533.
It is not a de Polignac number, because 335215152041 - 26 = 335215151977 is a prime.
It is a super-2 number, since 2×3352151520412 (a number of 24 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 = 335215151989 and 335215152007.
It is not an unprimeable number, because it can be changed into a prime (335215152043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69785 + ... + 821766.
It is an arithmetic number, because the mean of its divisors is an integer number (13801224960).
Almost surely, 2335215152041 is an apocalyptic number.
It is an amenable number.
335215152041 is a deficient number, since it is larger than the sum of its proper divisors (106424046679).
335215152041 is a wasteful number, since it uses less digits than its factorization.
335215152041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 891845.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 335215152041 its reverse (140251512533), we get a palindrome (475466664574).
The spelling of 335215152041 in words is "three hundred thirty-five billion, two hundred fifteen million, one hundred fifty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •