Base | Representation |
---|---|
bin | 1011111011111100100… |
… | …00010111100010001001 |
3 | 1110012122100222111001210 |
4 | 11331332100113202021 |
5 | 23204431332104113 |
6 | 512225450003333 |
7 | 41426440303530 |
oct | 5757620274211 |
9 | 1405570874053 |
10 | 410140113033 |
11 | 148a37446402 |
12 | 675a3116549 |
13 | 2c8a3375421 |
14 | 15bcab99317 |
15 | aa06c316c3 |
hex | 5f7e417889 |
410140113033 has 8 divisors (see below), whose sum is σ = 624975410368. Its totient is φ = 234365778864.
The previous prime is 410140113029. The next prime is 410140113059. The reversal of 410140113033 is 330311041014.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 410140113033 - 22 = 410140113029 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 19530481573 = 410140113033 / (4 + 1 + 0 + 1 + 4 + 0 + 1 + 1 + 3 + 0 + 3 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (410140113023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9765240766 + ... + 9765240807.
It is an arithmetic number, because the mean of its divisors is an integer number (78121926296).
Almost surely, 2410140113033 is an apocalyptic number.
It is an amenable number.
410140113033 is a deficient number, since it is larger than the sum of its proper divisors (214835297335).
410140113033 is a wasteful number, since it uses less digits than its factorization.
410140113033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19530481583.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 410140113033 its reverse (330311041014), we get a palindrome (740451154047).
The spelling of 410140113033 in words is "four hundred ten billion, one hundred forty million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •