Base | Representation |
---|---|
bin | 11110010001011001001… |
… | …10010101101000011110 |
3 | 10200102202110201120112121 |
4 | 33020230212111220132 |
5 | 114020141331130324 |
6 | 2113455042453154 |
7 | 135101253646030 |
oct | 17105446255036 |
9 | 3612673646477 |
10 | 1040130333214 |
11 | 371131503235 |
12 | 1497016641ba |
13 | 7711235243b |
14 | 384b205dc50 |
15 | 1c0c98e55e4 |
hex | f22c995a1e |
1040130333214 has 16 divisors (see below), whose sum is σ = 1840599300096. Its totient is φ = 431390460600.
The previous prime is 1040130333211. The next prime is 1040130333247. The reversal of 1040130333214 is 4123330310401.
1040130333214 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10401303332142 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040130333211) 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, 1198306402 + ... + 1198307269.
It is an arithmetic number, because the mean of its divisors is an integer number (115037456256).
Almost surely, 21040130333214 is an apocalyptic number.
1040130333214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1040130333214 is a deficient number, since it is larger than the sum of its proper divisors (800468966882).
1040130333214 is a wasteful number, since it uses less digits than its factorization.
1040130333214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2396613711.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1040130333214 its reverse (4123330310401), we get a palindrome (5163460643615).
The spelling of 1040130333214 in words is "one trillion, forty billion, one hundred thirty million, three hundred thirty-three thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •