Base | Representation |
---|---|
bin | 1011000010101001011110… |
… | …0111100101001011010010 |
3 | 1120222120202221001101001211 |
4 | 2300222113213211023102 |
5 | 3042400432024022002 |
6 | 41453032244050334 |
7 | 2362044344354653 |
oct | 260522747451322 |
9 | 46876687041054 |
10 | 12140121314002 |
11 | 3960661a97a50 |
12 | 1440a060939aa |
13 | 6a0a684488c6 |
14 | 2dd82938952a |
15 | 160bd4606dd7 |
hex | b0a979e52d2 |
12140121314002 has 8 divisors (see below), whose sum is σ = 19865653059312. Its totient is φ = 5518236960900.
The previous prime is 12140121313967. The next prime is 12140121314021. The reversal of 12140121314002 is 20041312104121.
12140121314002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 551823696091 = 12140121314002 / (1 + 2 + 1 + 4 + 0 + 1 + 2 + 1 + 3 + 1 + 4 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 275911848024 + ... + 275911848067.
It is an arithmetic number, because the mean of its divisors is an integer number (2483206632414).
Almost surely, 212140121314002 is an apocalyptic number.
12140121314002 is a deficient number, since it is larger than the sum of its proper divisors (7725531745310).
12140121314002 is a wasteful number, since it uses less digits than its factorization.
12140121314002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 551823696104.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 12140121314002 its reverse (20041312104121), we get a palindrome (32181433418123).
The spelling of 12140121314002 in words is "twelve trillion, one hundred forty billion, one hundred twenty-one million, three hundred fourteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •