Base | Representation |
---|---|
bin | 1001001110001111101100… |
… | …0101110001000011111010 |
3 | 1022220101222102001210120212 |
4 | 2103203323011301003322 |
5 | 2312114401331131300 |
6 | 33322223351551122 |
7 | 2064420651560456 |
oct | 223437305610372 |
9 | 38811872053525 |
10 | 10140335411450 |
11 | 325a545a88802 |
12 | 117932198b4a2 |
13 | 5872ca36641a |
14 | 270b1b10b666 |
15 | 128b9031a935 |
hex | 938fb1710fa |
10140335411450 has 12 divisors (see below), whose sum is σ = 18861023865390. Its totient is φ = 4056134164560.
The previous prime is 10140335411449. The next prime is 10140335411467. The reversal of 10140335411450 is 5411453304101.
It can be written as a sum of positive squares in 3 ways, for example, as 9451191369841 + 689144041609 = 3074279^2 + 830147^2 .
It is a super-2 number, since 2×101403354114502 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 101403354065 + ... + 101403354164.
Almost surely, 210140335411450 is an apocalyptic number.
10140335411450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10140335411450 is a deficient number, since it is larger than the sum of its proper divisors (8720688453940).
10140335411450 is a wasteful number, since it uses less digits than its factorization.
10140335411450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202806708241 (or 202806708236 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 10140335411450 its reverse (5411453304101), we get a palindrome (15551788715551).
The spelling of 10140335411450 in words is "ten trillion, one hundred forty billion, three hundred thirty-five million, four hundred eleven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •