Base | Representation |
---|---|
bin | 10010010000000000010010… |
… | …00110111001001001010001 |
3 | 12021002121112212221001201021 |
4 | 21020000021012321021101 |
5 | 20230012001231400242 |
6 | 221204311523435441 |
7 | 11311315323603343 |
oct | 1110001106711121 |
9 | 167077485831637 |
10 | 40132327215697 |
11 | 1187302a513862 |
12 | 4601ab7225b81 |
13 | 1951601652cb2 |
14 | 9ca5b4a99293 |
15 | 498e0202ab67 |
hex | 2480091b9251 |
40132327215697 has 4 divisors (see below), whose sum is σ = 40144999251456. Its totient is φ = 40119655179940.
The previous prime is 40132327215691. The next prime is 40132327215727. The reversal of 40132327215697 is 79651272323104.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40132327215697 is a prime.
It is a super-2 number, since 2×401323272156972 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40132327215691) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6336013129 + ... + 6336019462.
It is an arithmetic number, because the mean of its divisors is an integer number (10036249812864).
Almost surely, 240132327215697 is an apocalyptic number.
It is an amenable number.
40132327215697 is a deficient number, since it is larger than the sum of its proper divisors (12672035759).
40132327215697 is a wasteful number, since it uses less digits than its factorization.
40132327215697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12672035758.
The product of its (nonzero) digits is 3810240, while the sum is 52.
The spelling of 40132327215697 in words is "forty trillion, one hundred thirty-two billion, three hundred twenty-seven million, two hundred fifteen thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •