Base | Representation |
---|---|
bin | 11011100011110111110111… |
… | …111101110010100000001110 |
3 | 120220011210110210220212221012 |
4 | 123203313313331302200032 |
5 | 111341421030122333124 |
6 | 1105444120031205222 |
7 | 34350211032124010 |
oct | 3343676775624016 |
9 | 526153423825835 |
10 | 121212432230414 |
11 | 356929a3aa0a98 |
12 | 11717946376812 |
13 | 528338b593a25 |
14 | 21d09da76a1b0 |
15 | e030309dee0e |
hex | 6e3df7f7280e |
121212432230414 has 16 divisors (see below), whose sum is σ = 207792931500000. Its totient is φ = 51948137608224.
The previous prime is 121212432230371. The next prime is 121212432230429. The reversal of 121212432230414 is 414032234212121.
It is a super-2 number, since 2×1212124322304142 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14955212 + ... + 21588960.
It is an arithmetic number, because the mean of its divisors is an integer number (12987058218750).
Almost surely, 2121212432230414 is an apocalyptic number.
121212432230414 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
121212432230414 is a deficient number, since it is larger than the sum of its proper divisors (86580499269586).
121212432230414 is a wasteful number, since it uses less digits than its factorization.
121212432230414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7938907.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 121212432230414 its reverse (414032234212121), we get a palindrome (535244666442535).
The spelling of 121212432230414 in words is "one hundred twenty-one trillion, two hundred twelve billion, four hundred thirty-two million, two hundred thirty thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •