Base | Representation |
---|---|
bin | 10010010011101100001000… |
… | …00010100001111101011010 |
3 | 12021112201101000012222121000 |
4 | 21021312010002201331122 |
5 | 20234100304043040211 |
6 | 221342411534525430 |
7 | 11323420104256512 |
oct | 1111660402417532 |
9 | 167481330188530 |
10 | 40258943721306 |
11 | 119117a4200532 |
12 | 4622552966876 |
13 | 196052c56072b |
14 | 9d2786a52842 |
15 | 49c362ce7656 |
hex | 249d840a1f5a |
40258943721306 has 32 divisors (see below), whose sum is σ = 89526751038720. Its totient is φ = 13410283158432.
The previous prime is 40258943721251. The next prime is 40258943721307. The reversal of 40258943721306 is 60312734985204.
40258943721306 is a `hidden beast` number, since 4 + 0 + 2 + 58 + 94 + 372 + 130 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (40258943721307) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 260053810 + ... + 260208573.
It is an arithmetic number, because the mean of its divisors is an integer number (2797710969960).
It is a 1-persistent number, because it is pandigital, but 2⋅40258943721306 = 80517887442612 is not.
Almost surely, 240258943721306 is an apocalyptic number.
40258943721306 is an abundant number, since it is smaller than the sum of its proper divisors (49267807317414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40258943721306 is a wasteful number, since it uses less digits than its factorization.
40258943721306 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 520263827 (or 520263821 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 54.
The spelling of 40258943721306 in words is "forty trillion, two hundred fifty-eight billion, nine hundred forty-three million, seven hundred twenty-one thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •