Base | Representation |
---|---|
bin | 100101101010101010… |
… | …000010101001001001 |
3 | 10212101121201201212002 |
4 | 211222222002221021 |
5 | 1130312143031213 |
6 | 30325121400345 |
7 | 2631146163215 |
oct | 455252025111 |
9 | 125347651762 |
10 | 40444111433 |
11 | 16174712590 |
12 | 7a087990b5 |
13 | 3a77099bab |
14 | 1d59575945 |
15 | 10ba9b0658 |
hex | 96aa82a49 |
40444111433 has 32 divisors (see below), whose sum is σ = 45818099712. Its totient is φ = 35380900800.
The previous prime is 40444111403. The next prime is 40444111537. The reversal of 40444111433 is 33411144404.
It is a cyclic number.
It is not a de Polignac number, because 40444111433 - 212 = 40444107337 is a prime.
It is a super-2 number, since 2×404441114332 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40444111396 and 40444111405.
It is not an unprimeable number, because it can be changed into a prime (40444111403) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16526816 + ... + 16529262.
It is an arithmetic number, because the mean of its divisors is an integer number (1431815616).
Almost surely, 240444111433 is an apocalyptic number.
40444111433 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
40444111433 is a deficient number, since it is larger than the sum of its proper divisors (5373988279).
40444111433 is a wasteful number, since it uses less digits than its factorization.
40444111433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3005.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 40444111433 its reverse (33411144404), we get a palindrome (73855255837).
The spelling of 40444111433 in words is "forty billion, four hundred forty-four million, one hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •