Base | Representation |
---|---|
bin | 10100110100001100100… |
… | …100111100100111111100 |
3 | 12001202012111001011120000 |
4 | 110310030210330213330 |
5 | 141414012342343120 |
6 | 3013044404554300 |
7 | 205226341630116 |
oct | 24641444744774 |
9 | 5052174034500 |
10 | 1430435121660 |
11 | 50170a3756a6 |
12 | 1b12899b2990 |
13 | a4b741897bc |
14 | 4d33a75c3b6 |
15 | 27320088990 |
hex | 14d0c93c9fc |
1430435121660 has 60 divisors (see below), whose sum is σ = 4487327960808. Its totient is φ = 381449365344.
The previous prime is 1430435121637. The next prime is 1430435121679. The reversal of 1430435121660 is 661215340341.
1430435121660 is a `hidden beast` number, since 1 + 4 + 3 + 0 + 435 + 1 + 216 + 6 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×14304351216602 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 441490702 + ... + 441493941.
Almost surely, 21430435121660 is an apocalyptic number.
1430435121660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1430435121660 is an abundant number, since it is smaller than the sum of its proper divisors (3056892839148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1430435121660 is a wasteful number, since it uses less digits than its factorization.
1430435121660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 882984664 (or 882984653 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 1430435121660 in words is "one trillion, four hundred thirty billion, four hundred thirty-five million, one hundred twenty-one thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •