Base | Representation |
---|---|
bin | 1001010010111110110100… |
… | …10001000000010011011110 |
3 | 2200101101000110221222210020 |
4 | 10221133122101000103132 |
5 | 10134421101240034241 |
6 | 111251323512053010 |
7 | 4206662534335050 |
oct | 451373221002336 |
9 | 80341013858706 |
10 | 20443411252446 |
11 | 6572002769976 |
12 | 23620a1094166 |
13 | b53a6163a0b0 |
14 | 509675a878d0 |
15 | 256ba7992b66 |
hex | 1297da4404de |
20443411252446 has 64 divisors (see below), whose sum is σ = 50323057602048. Its totient is φ = 5391581632128.
The previous prime is 20443411252367. The next prime is 20443411252519. The reversal of 20443411252446 is 64425211434402.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 20443411252398 and 20443411252407.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37857436 + ... + 38393648.
It is an arithmetic number, because the mean of its divisors is an integer number (786297775032).
Almost surely, 220443411252446 is an apocalyptic number.
20443411252446 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
20443411252446 is an abundant number, since it is smaller than the sum of its proper divisors (29879646349602).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20443411252446 is a wasteful number, since it uses less digits than its factorization.
20443411252446 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606065.
The product of its (nonzero) digits is 737280, while the sum is 42.
Adding to 20443411252446 its reverse (64425211434402), we get a palindrome (84868622686848).
The spelling of 20443411252446 in words is "twenty trillion, four hundred forty-three billion, four hundred eleven million, two hundred fifty-two thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •