Base | Representation |
---|---|
bin | 10010001100101111010110… |
… | …11011000001100110001111 |
3 | 12020200220000202120111101000 |
4 | 21012113223123001212033 |
5 | 20221142241431331043 |
6 | 221041001355351343 |
7 | 11300234605331511 |
oct | 1106275333014617 |
9 | 166626022514330 |
10 | 40020160027023 |
11 | 1182a500014830 |
12 | 45a4212752553 |
13 | 1943b67172237 |
14 | 9c4db3b39bb1 |
15 | 496039a482d3 |
hex | 2465eb6c198f |
40020160027023 has 32 divisors (see below), whose sum is σ = 64840341081600. Its totient is φ = 24194156976000.
The previous prime is 40020160026989. The next prime is 40020160027027. The reversal of 40020160027023 is 32072006102004.
It is a de Polignac number, because none of the positive numbers 2k-40020160027023 is a prime.
It is a super-2 number, since 2×400201600270232 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40020160027027) 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, 167895883 + ... + 168134076.
It is an arithmetic number, because the mean of its divisors is an integer number (2026260658800).
Almost surely, 240020160027023 is an apocalyptic number.
40020160027023 is a deficient number, since it is larger than the sum of its proper divisors (24820181054577).
40020160027023 is a wasteful number, since it uses less digits than its factorization.
40020160027023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336030380 (or 336030374 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
Adding to 40020160027023 its reverse (32072006102004), we get a palindrome (72092166129027).
The spelling of 40020160027023 in words is "forty trillion, twenty billion, one hundred sixty million, twenty-seven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •