Base | Representation |
---|---|
bin | 10010001111001000011001… |
… | …10110011000000000011011 |
3 | 12020222202002222212221111021 |
4 | 21013210030312120000123 |
5 | 20224014030224122301 |
6 | 221142430500543311 |
7 | 11306204001066241 |
oct | 1107441466300033 |
9 | 166882088787437 |
10 | 40102325223451 |
11 | 11861334139a47 |
12 | 45b81236b1b37 |
13 | 194b82ca4116a |
14 | 9c8d6a292791 |
15 | 49824815b8a1 |
hex | 24790cd9801b |
40102325223451 has 8 divisors (see below), whose sum is σ = 40553244613440. Its totient is φ = 39651413199552.
The previous prime is 40102325223343. The next prime is 40102325223473. The reversal of 40102325223451 is 15432252320104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40102325223451 - 211 = 40102325221403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40102325223481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9498441 + ... + 13054693.
It is an arithmetic number, because the mean of its divisors is an integer number (5069155576680).
Almost surely, 240102325223451 is an apocalyptic number.
40102325223451 is a deficient number, since it is larger than the sum of its proper divisors (450919389989).
40102325223451 is a wasteful number, since it uses less digits than its factorization.
40102325223451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3683045.
The product of its (nonzero) digits is 57600, while the sum is 34.
Adding to 40102325223451 its reverse (15432252320104), we get a palindrome (55534577543555).
The spelling of 40102325223451 in words is "forty trillion, one hundred two billion, three hundred twenty-five million, two hundred twenty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •