Base | Representation |
---|---|
bin | 10010100001110000011000… |
… | …11011110101100000011101 |
3 | 12100020220220201212021110000 |
4 | 21100320030123311200131 |
5 | 20320010131202043001 |
6 | 222352423440004513 |
7 | 11403350251223133 |
oct | 1120701433654035 |
9 | 170226821767400 |
10 | 40742268393501 |
11 | 11a887763a5384 |
12 | 46a015b300739 |
13 | 1996c96a43b1c |
14 | a0bd1734d753 |
15 | 4a9bee9d7a86 |
hex | 250e0c6f581d |
40742268393501 has 80 divisors (see below), whose sum is σ = 63214230739968. Its totient is φ = 26122630636800.
The previous prime is 40742268393473. The next prime is 40742268393503. The reversal of 40742268393501 is 10539386224704.
40742268393501 is a `hidden beast` number, since 4 + 0 + 7 + 42 + 2 + 6 + 8 + 3 + 93 + 501 = 666.
It is not a de Polignac number, because 40742268393501 - 223 = 40742260004893 is a prime.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40742268393503) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 3950568721 + ... + 3950579033.
It is a 1-persistent number, because it is pandigital, but 2⋅40742268393501 = 81484536787002 is not.
Almost surely, 240742268393501 is an apocalyptic number.
It is an amenable number.
40742268393501 is a deficient number, since it is larger than the sum of its proper divisors (22471962346467).
40742268393501 is a wasteful number, since it uses less digits than its factorization.
40742268393501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19944 (or 19935 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 54.
The spelling of 40742268393501 in words is "forty trillion, seven hundred forty-two billion, two hundred sixty-eight million, three hundred ninety-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •