Base | Representation |
---|---|
bin | 1001001110100010100110… |
… | …1000000110100001000000 |
3 | 1022220220002010221002110201 |
4 | 2103220221220012201000 |
5 | 2312210300222201311 |
6 | 33324423150134544 |
7 | 2064660513514126 |
oct | 223505150064100 |
9 | 38826063832421 |
10 | 10145411131456 |
11 | 3261710103327 |
12 | 117a2b97b1454 |
13 | 587928ab7243 |
14 | 27107d27d916 |
15 | 128d8ac2c9c1 |
hex | 93a29a06840 |
10145411131456 has 14 divisors (see below), whose sum is σ = 20132300214110. Its totient is φ = 5072705565696.
The previous prime is 10145411131447. The next prime is 10145411131477. The reversal of 10145411131456 is 65413111454101.
It can be written as a sum of positive squares in only one way, i.e., 6822752961600 + 3322658169856 = 2612040^2 + 1822816^2 .
It is a super-2 number, since 2×101454111314562 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 79261024401 + ... + 79261024528.
It is an arithmetic number, because the mean of its divisors is an integer number (1438021443865).
Almost surely, 210145411131456 is an apocalyptic number.
10145411131456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10145411131456 is a deficient number, since it is larger than the sum of its proper divisors (9986889082654).
10145411131456 is an equidigital number, since it uses as much as digits as its factorization.
10145411131456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158522048941 (or 158522048931 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 37.
Adding to 10145411131456 its reverse (65413111454101), we get a palindrome (75558522585557).
The spelling of 10145411131456 in words is "ten trillion, one hundred forty-five billion, four hundred eleven million, one hundred thirty-one thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •