Base | Representation |
---|---|
bin | 10010011110001101010001… |
… | …00010111101001111100010 |
3 | 12022211021011212202120100221 |
4 | 21033012220202331033202 |
5 | 20311010420331014211 |
6 | 222220420143033254 |
7 | 11361502505311444 |
oct | 1117065042751742 |
9 | 168737155676327 |
10 | 40620333454306 |
11 | 11a40a942a0861 |
12 | 46805ab59b82a |
13 | 1988633a11a28 |
14 | a0606b046494 |
15 | 4a6964c21c71 |
hex | 24f1a88bd3e2 |
40620333454306 has 32 divisors (see below), whose sum is σ = 62871838349760. Its totient is φ = 19671318084096.
The previous prime is 40620333454297. The next prime is 40620333454307. The reversal of 40620333454306 is 60345433302604.
40620333454306 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×406203334543062 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is not an unprimeable number, because it can be changed into a prime (40620333454307) 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 15 ways as a sum of consecutive naturals, for example, 8785690 + ... + 12586858.
It is an arithmetic number, because the mean of its divisors is an integer number (1964744948430).
Almost surely, 240620333454306 is an apocalyptic number.
40620333454306 is a deficient number, since it is larger than the sum of its proper divisors (22251504895454).
40620333454306 is a wasteful number, since it uses less digits than its factorization.
40620333454306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3802258.
The product of its (nonzero) digits is 1866240, while the sum is 43.
The spelling of 40620333454306 in words is "forty trillion, six hundred twenty billion, three hundred thirty-three million, four hundred fifty-four thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •