Base | Representation |
---|---|
bin | 10010000011010100011… |
… | …010100011111100110000 |
3 | 11101120222120112111200210 |
4 | 102003110122203330300 |
5 | 130311033131022112 |
6 | 2345515010544120 |
7 | 155424046455450 |
oct | 22032432437460 |
9 | 4346876474623 |
10 | 1240514314032 |
11 | 43910aa98954 |
12 | 180505898040 |
13 | 8cc980946a6 |
14 | 44081135d60 |
15 | 22406916b3c |
hex | 120d46a3f30 |
1240514314032 has 320 divisors, whose sum is σ = 3754141433856. Its totient is φ = 345691100160.
The previous prime is 1240514314021. The next prime is 1240514314037. The reversal of 1240514314032 is 2304134150421.
It is not an unprimeable number, because it can be changed into a prime (1240514314037) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1022682258 + ... + 1022683470.
Almost surely, 21240514314032 is an apocalyptic number.
1240514314032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1240514314032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1877070716928).
1240514314032 is an abundant number, since it is smaller than the sum of its proper divisors (2513627119824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1240514314032 is a wasteful number, since it uses less digits than its factorization.
1240514314032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1728 (or 1722 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 1240514314032 its reverse (2304134150421), we get a palindrome (3544648464453).
The spelling of 1240514314032 in words is "one trillion, two hundred forty billion, five hundred fourteen million, three hundred fourteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •