Base | Representation |
---|---|
bin | 101111111001011011110011… |
… | …0111011000110111101011101 |
3 | 2001020201212000100022021112220 |
4 | 1133302313212323012331131 |
5 | 420210221041403034323 |
6 | 4052015104421015553 |
7 | 154512436030420311 |
oct | 13762674673067535 |
9 | 2036655010267486 |
10 | 421310101221213 |
11 | 112273679675926 |
12 | 3b3048785545b9 |
13 | 151114ab596999 |
14 | 7607736801b41 |
15 | 33a9398ade0e3 |
hex | 17f2de6ec6f5d |
421310101221213 has 16 divisors (see below), whose sum is σ = 563837124846720. Its totient is φ = 279829648733184.
The previous prime is 421310101221199. The next prime is 421310101221223. The reversal of 421310101221213 is 312122101013124.
It is not a de Polignac number, because 421310101221213 - 226 = 421310034112349 is a prime.
It is a super-2 number, since 2×4213101012212132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421310101221223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 174994681 + ... + 177385902.
It is an arithmetic number, because the mean of its divisors is an integer number (35239820302920).
Almost surely, 2421310101221213 is an apocalyptic number.
It is an amenable number.
421310101221213 is a deficient number, since it is larger than the sum of its proper divisors (142527023625507).
421310101221213 is a wasteful number, since it uses less digits than its factorization.
421310101221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352382068.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 421310101221213 its reverse (312122101013124), we get a palindrome (733432202234337).
The spelling of 421310101221213 in words is "four hundred twenty-one trillion, three hundred ten billion, one hundred one million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •