Base | Representation |
---|---|
bin | 100101101000101011… |
… | …110001110000111001 |
3 | 10212022022110010011211 |
4 | 211220223301300321 |
5 | 1130230204342103 |
6 | 30321540123121 |
7 | 2630264635651 |
oct | 455053616071 |
9 | 125268403154 |
10 | 40411012153 |
11 | 16157a65606 |
12 | 79b96964a1 |
13 | 3a7027b315 |
14 | 1d54ddb361 |
15 | 10b7b2336d |
hex | 968af1c39 |
40411012153 has 4 divisors (see below), whose sum is σ = 40414417380. Its totient is φ = 40407606928.
The previous prime is 40411012141. The next prime is 40411012199. The reversal of 40411012153 is 35121011404.
40411012153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4745556544 + 35665455609 = 68888^2 + 188853^2 .
It is a cyclic number.
It is not a de Polignac number, because 40411012153 - 217 = 40410881081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40411012553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1684750 + ... + 1708567.
It is an arithmetic number, because the mean of its divisors is an integer number (10103604345).
Almost surely, 240411012153 is an apocalyptic number.
It is an amenable number.
40411012153 is a deficient number, since it is larger than the sum of its proper divisors (3405227).
40411012153 is a wasteful number, since it uses less digits than its factorization.
40411012153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3405226.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 40411012153 its reverse (35121011404), we get a palindrome (75532023557).
The spelling of 40411012153 in words is "forty billion, four hundred eleven million, twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •