Base | Representation |
---|---|
bin | 100101110011110101… |
… | …111000100111111101 |
3 | 10212210100200210211000 |
4 | 211303311320213331 |
5 | 1131121120223234 |
6 | 30352304320513 |
7 | 2635030046253 |
oct | 456365704775 |
9 | 125710623730 |
10 | 40598211069 |
11 | 162436a4959 |
12 | 7a50313139 |
13 | 3a9cca2b00 |
14 | 1d71c0a5d3 |
15 | 10c929e899 |
hex | 973d789fd |
40598211069 has 48 divisors (see below), whose sum is σ = 68555899200. Its totient is φ = 23668542144.
The previous prime is 40598211001. The next prime is 40598211091. The reversal of 40598211069 is 96011289504.
40598211069 is a `hidden beast` number, since 40 + 598 + 2 + 1 + 10 + 6 + 9 = 666.
It is not a de Polignac number, because 40598211069 - 27 = 40598210941 is a prime.
It is a super-2 number, since 2×405982110692 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40598211769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 147442 + ... + 320835.
It is an arithmetic number, because the mean of its divisors is an integer number (1428247900).
Almost surely, 240598211069 is an apocalyptic number.
It is an amenable number.
40598211069 is a deficient number, since it is larger than the sum of its proper divisors (27957688131).
40598211069 is a wasteful number, since it uses less digits than its factorization.
40598211069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468331 (or 468312 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 45.
It can be divided in two parts, 4059 and 8211069, that added together give a palindrome (8215128).
The spelling of 40598211069 in words is "forty billion, five hundred ninety-eight million, two hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •