Base | Representation |
---|---|
bin | 10111011011000010100001… |
… | …010000101001000010000100 |
3 | 111111201222002002211020220111 |
4 | 113123002201100221002010 |
5 | 102000232013441341122 |
6 | 1003031340012042404 |
7 | 30461313104111641 |
oct | 2733024120510204 |
9 | 444658062736814 |
10 | 103013201121412 |
11 | 2a90672053684a |
12 | b678794763404 |
13 | 456314590539a |
14 | 1b61c19068dc8 |
15 | bd9922e41d77 |
hex | 5db0a1429084 |
103013201121412 has 12 divisors (see below), whose sum is σ = 180274704167376. Its totient is φ = 51506142787880.
The previous prime is 103013201121401. The next prime is 103013201121527. The reversal of 103013201121412 is 214121102310301.
It is a super-2 number, since 2×1030132011214122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113936638 + ... + 114837205.
It is an arithmetic number, because the mean of its divisors is an integer number (15022892013948).
Almost surely, 2103013201121412 is an apocalyptic number.
It is an amenable number.
103013201121412 is a deficient number, since it is larger than the sum of its proper divisors (77261503045964).
103013201121412 is a wasteful number, since it uses less digits than its factorization.
103013201121412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228886418 (or 228886416 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 103013201121412 its reverse (214121102310301), we get a palindrome (317134303431713).
The spelling of 103013201121412 in words is "one hundred three trillion, thirteen billion, two hundred one million, one hundred twenty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •