Base | Representation |
---|---|
bin | 10010010000000011110101… |
… | …01100111100000000011111 |
3 | 12021002210110201000122220211 |
4 | 21020001322230330000133 |
5 | 20230024402122424203 |
6 | 221205225003353251 |
7 | 11311413464613451 |
oct | 1110017254740037 |
9 | 167083421018824 |
10 | 40134233014303 |
11 | 1187391826a52a |
12 | 4602349522827 |
13 | 1951846436c8c |
14 | 9ca715c322d1 |
15 | 498eb44d1c6d |
hex | 24807ab3c01f |
40134233014303 has 8 divisors (see below), whose sum is σ = 40168798750080. Its totient is φ = 40099668550680.
The previous prime is 40134233014297. The next prime is 40134233014327. The reversal of 40134233014303 is 30341033243104.
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 40134233014303 - 213 = 40134233006111 is a prime.
It is a super-2 number, since 2×401342330143032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40134233012303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69363868 + ... + 69940078.
It is an arithmetic number, because the mean of its divisors is an integer number (5021099843760).
Almost surely, 240134233014303 is an apocalyptic number.
40134233014303 is a deficient number, since it is larger than the sum of its proper divisors (34565735777).
40134233014303 is a wasteful number, since it uses less digits than its factorization.
40134233014303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 636077.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 40134233014303 its reverse (30341033243104), we get a palindrome (70475266257407).
The spelling of 40134233014303 in words is "forty trillion, one hundred thirty-four billion, two hundred thirty-three million, fourteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •